Question

The average depth of a binary search tree is:
0(n^0.5)
O on)
O O(logn)
O on logn)​

Answer 1

Answer:

ghggbhjjhhhggffcvbngghfhfthiygvbifvbgg