Consider the following list of numbers.

Question

128, 682, 121, 516, 601, 51, 49 The height of a binary search tree is the maximum number of edges you have to go through to reach the bottom of the tree, starting at the root. What is the height of the tree for the numbers above, in the order given?

Answer 1

The tree is 3 deep

 

Under 128 is 121,682

 

Under 121 is 51 and under 682 is 516

 

49 and 601 are at the bottom under 51 and 516 respectively

 

That's three edges from the root