The following numbers are inserted into an empty binary search tree in the given order: 11, 2, 4, 5, 15, 13, 16. What is the height of this binary search tree?

Assume the height of a tree is the number of edges on the longest downward path between the root and a leaf.

×

Problem Loading...

Note Loading...

Set Loading...