Question: Write a program that inserts the following numbers into an initially empty BST such that the tree produced is equivalent to binary search tree. 50

Write a program that inserts the following numbers into an initially empty BST such that the tree produced is equivalent to binary search tree.

 50 30 25 75 82 28 63 70 4 43 74

Hint: Calculate the mean value in method and put that value at the root and recursively build the left and right subtree.

A. Implement a function which, given a node in this binary search tree, prints out the maximum depths of its left and right subtrees. 

B. Implement a function to find the maximum value of all the nodes in the tree. 

C. Implement a function that balance the tree using appropriate rotation type and return the root value. Note: You are not allowed to use any built-in Data Structure classes to implement above scenario.

Step by Step Solution

3.43 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Here to write the implementation of binary search tree i used python language to write code for bina... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!