Forgot password? New user? Sign up

Existing user? Log in

Given the following (sorted) array with distinct integer elements, write an algorithm to construct a balanced binary search tree.

What is the maximum depth of the tree?

[1, 2, 3, 5, 8, 9,10, 11, 13, 14, 16, 17,18, 19, 20, 25, 40, 39, 100, 560]

Problem Loading...

Note Loading...

Set Loading...