HaPow6019
HaPow6019
07.11.2019 • 
Mathematics

Consider the following list of numbers.
129, 682, 121, 516, 609, 52, 47
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?

Solved
Show answers

Ask an AI advisor a question