(Python)Given an array, construct a BST. Use the BST to find the predecessor q(Largest element, but no larger than q). Here is my code for finding predecessor q after constructing the BST. The problem is when q equals to one of the number in the BST, it does not return that number. For example, an array [47,25,23,81,59] with q = 81 should return 81. My program return 59. def findPre(root, key):if root is None:returnif root.data == key:if root.left is not None:tmp = root.leftwhile tmp.right:tmp = tmp.rightfindPre.pre = tmpif root.right is not None:tmp = root.rightwhile tmp.left:tmp = tmp.leftfindPre.suc = tmpreturnif root.data < key:findPre.pre = rootfindPre(root.right, key)numbers = readInfoText()numbers.sort()|root = sortedArrayToBST(numbers)preOrder(root)findPre.pre= NonefindPre(root, 81)if findPre.pre is not None:print("Pre ="«findPre.pre.data)else:print("No") 4725238159= 59Pre

def findPre(root, key): if root is None: return if root.data == key: if root.left is not None:…

Answered: (Python)Given an array, construct a…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

(Python)Given an array, construct a BST. Use the BST to find the predecessor q(Largest element, but no larger than q). Here is my code for finding predecessor q after constructing the BST. The problem is when q equals to one of the number in the BST, it does not return that number. For example, an array [47,25,23,81,59] with q = 81 should return 81. My program return 59.