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 nn nodes?

  1. A.

    O(1)O(1)

  2. B.

    O(log n)O(log \ n)

  3. C.

    O(n)O(n)

  4. D.

    O(n log n)O(n \ log \ n)

Attempted by 1171 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…