Q. 5 The worst case running time to search for an element in a balanced in a binary search tree with 
elements is
Answer: (C)
Explanation:
Q. 5 The worst case running time to search for an element in a balanced in a binary search tree with elements is
Answer: (C)
Explanation:
