A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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)
b. O(1)
c. O(log n)
d. O(n log n)
Answer:O(log n)
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here