Question: Part A - Create a new empty binary search tree. Insert 8 , 4 , 1 2 , 2 , 6 , 1 0 ,

Part A- Create a new empty binary search tree. Insert 8,4,12,2,6,10,14,1,3,5,7,9,11,13,15, in that order. Show all keys of the tree in Inorder traversal.
Perform search(1) and search(15)100,000 times and record the CPU time taken by each of these.
Part B-Remove key 8 and show the keys of the resulting tree (again, in inorder traversal).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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 Databases Questions!