Sail E0 Webinar
Question
The worst case running time to search for an element in a balanced binary search tree with n2n elements is
Options:
A .  Î˜ (n log n)
B .  Î˜ (n2n)
C .  Î˜ (n)
D .  Î˜ (log n)
Answer: Option C


-NA-



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos

Latest Test Papers