Consider the following list of numbers. 129, 685, 125, 511, 601, 52, 46 The height of a binary search tree is the maximum number

Question

3 years ago

9

Consider the following list of numbers. 129, 685, 125, 511, 601, 52, 46 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?

Physics

1 answer:

NemiM [27] · Answer 1 · 2022-01-31T20:02:40+03:00

NemiM [27]3 years ago

5 0

Answer:

The height of the tree is three (3) deep

Explanation:

It's 3 deep

Under 129, comes 125 and 685;

Under 125, comes 52 : Under 685, comes 511;

Under 52, comes 46 : Under 511, is 601.

This is illustrated below.

129

∧

125,685

|,|

52,511

|,|

46,601