Which one of the following is the tightest upper bound that represents the…

GATE · 2013 · CS · Computer Science & IT

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(1) \)
B.
\(O(log \ n) \)
C.
\(O(n)\)
D.
\(O(n \ log \ n) \)

Attempted by 1073 students.

Show answer

Correct answer: C

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2