Question: Question 1: a) What do you think that if Binary search tree is d levels deep then what would be the cost of searching the

Question 1: a) What do you think that if Binary search tree is d levels deep then what would be the cost of searching the element from the BST justify your answer with example?

(b) Create a BST from the given data? Recursively traverse the created BST also give the name of the Traversals?

70, 60, 90, 80, 30,40,10,85,75,5

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!