Users Also Read
MCQ's Search Engine
Electrical Engineering
Mechanical Engineering
Civil Engineering
Automobile Engineering
Chemical Engineering
Computer Engineering
Electronics Engineering
Medical Science Engg
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? | |
A. | O(n) [Wrong Answer] |
B. | O(1) [Wrong Answer] |
C. | O(log n) [Correct Answer] |
D. | O(n log n) [Wrong Answer] |