#main.py # implement binary search tree insertion and traversals…

/in /by

Question Answered step-by-step #main.py # implement binary search tree insertion and traversals… Image transcription textImplement binary search tree insertion and traversals (inorder, preorder, postorder) with the starter code. (Note it is a special binary tree that has specific properties). main.py node.py. tree.py…. Show more#main.py# implement binary search tree insertion and traversals (inorder, preorder, postorder) with the starter code.import treeclass Main(): def __init__(self): binTree = tree.binaryTree() binTree.insert(4) binTree.insert(8) binTree.insert(2) binTree.insert(0) binTree.insert(6) binTree.insert(9) binTree.inorder(binTree.root) print ” binTree.preorder(binTree.root) print ” binTree.postorder(binTree.root)if __name__ == ‘__main__’: Main()#node.pyclass TreeNode: def __init__(self,data): self.data = data self.left = None self.right = None self.parent= None#tree.pyfrom node import TreeNode as Nodeclass binaryTree:def __init__(self):self.root = Nonedef insert(self,value): #TODO passdef inorder(self,node):if node is not None: #TODO passdef preorder(self,node):if node is not None: #TODO passdef postorder(self,node):if node is not None: #TODO pass Computer Science Engineering & Technology Python Programming CSCE 310j Share QuestionEmailCopy link Comments (0)