Question: Write and test a recursive version of the find function in BST class, write preorder and postorde……

Write and test a recursive version of the find function in BST class, write preorder and postorder traversal generators for the BST class. Example to generate a preorder traversal we write code like list(myBST.preorder()). And add a __len__ operation to BST class such that calling len(myBST) shoud return the number of items. In python please. The code needed is below and what i want to do is what i asked above about the find function and the rest.

class TreeNode(object):

Don't use plagiarized sources. Get Your Custom Essay on
Question: Write and test a recursive version of the find function in BST class, write preorder and postorde……
Get an essay WRITTEN FOR YOU, Plagiarism free, and by an EXPERT!
Order Essay

def __init__(self, data = None, left=None, right=None):

“””creates a tree node with specified data and references to left
and right children”””

self.item = data
self.left = left
self.right = right

from TreeNode import TreeNode

class BST:


def __init__(self):

“””create empty binary search tree
post: empty tree created”””

self.root = None


def insert(self, item):

“””insert item into binary search tree
pre: item is not in self
post: item has been added to self”””

if self.root is None: # handle empty tree case
self.root = TreeNode(item)
# start at root
node = self.root
# loop to find the correct spot (break to exit)
while True:
if item == node.item:
raise ValueError(“Inserting duplicate item”)

if item < node.item: # item goes in left subtree
if node.left is not None: # follow existing subtree
node = node.left
else: # empty subtree, insert here
node.left = TreeNode(item)
else: # item goes in right subtree
if node.right is not None: # follow existing subtree
node = node.right
else: # empty subtree, insert here
node.right = TreeNode(item)


def insert_rec(self, item):

“””insert item into binary search tree
pre: item is not in self
post: item has been added to self”””

self.root = self._subtreeInsert(self.root, item)


def _subtreeInsert(self, root, item):

if root is None: # inserting into empty tree
return TreeNode(item) # the item becomes the new tree root

if item == root.item:
raise ValueError(“Inserting duplicate item”)

if item < root.item: # modify left subtree
root.left = self._subtreeInsert(root.left, item)
else: # modify right subtree
root.right = self._subtreeInsert(root.right, item)

return root # original root is root of modified tree


def find(self, item):

“”” Search for item in BST
post: Returns item from BST if found, None otherwise”””

node = self.root
while node is not None and not(node.item == item):
if item < node.item:
node = node.left
node = node.right

if node is None:
return None
return node.item


def delete(self, item):

“””remove item from binary search tree
post: item is removed from the tree”””

self.root = self._subtreeDelete(self.root, item)


def _subtreeDelete(self, root, item):

if root is None: # Empty tree, nothing to do
return None
if item < root.item: # modify left
root.left = self._subtreeDelete(root.left, item)
elif item > root.item: # modify right
root.right = self._subtreeDelete(root.right, item)
else: # delete root
if root.left is None: # promote right subtree
root = root.right
elif root.right is None: # promote left subtree
root = root.left
# root node can’t be deleted, overwrite it with max of
# left subtree and delete max node from the subtree
root.item, root.left = self._subtreeDelMax(root.left)
return root


def _subtreeDelMax(self, root):

if root.right is None: # root is the max
return root.item, root.left # return max and promote left subtree
# max is in right subtree, recursively find and delete it
maxVal, root.right = self._subtreeDelMax(root.right)
return maxVal, root


def asList(self):

“””gets item in in-order traversal order
post: returns list of items in tree in orders”””

items = []
self._subtreeAddItems(self.root, items)
return items


def _subtreeAddItems(self, root, itemList):
if root is not None:
self._subtreeAddItems(root.left, itemList)
self._subtreeAddItems(root.right, itemList)


def visit(self, f):

“””perform an in-order traversal of the tree
post: calls f with each TreeNode item in an in-order traversal

self._inorderVisit(self.root, f)


def _inorderVisit(self, root, f):

if root is not None:
self._inorderVisit(root.left, f)
self._inorderVisit(root.right, f)


def __iter__(self):

“””in-order iterator for binary search tree”””

return self._inorderGen(self.root)


def _inorderGen(self, root):

if root is not None:
# yield all the items in the left subtree
for item in self._inorderGen(root.left):
yield item
yield root.item
# yield all the items from the right subtree
for item in self._inorderGen(root.right):
yield item


Expert Answer

Top Grade Homework
Order NOW For a 10% Discount!
Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

Professional and Experienced Academic Writers

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

24/7 Customer Support

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

Calculate the price of your order

Total price:

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.


Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.


Admission Essays & Business Writing Help

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.


Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.


Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.

× Contact Live Agents