The worst case running time to search for an element in a balanced binary search tree with n2n elements is
(A) Θ(n log n)
(D) Θ(log n)
Rewards per monthFirst Winner: 0 INR (Not Started)Second Winner: 0 INR (Not Started)
Show your Support. Become a FAN!