Sail E0 Webinar
Question
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
Options:
A .  O(1)
B .  O(log n)
C .  O(n)
D .  O(n 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