Ask Question
23 March, 05:05

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?

+2
Answers (1)
  1. 23 March, 05:09
    0
    121,129,52,47,516,682
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “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 ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers