Online GK Series

This site is dedicated to the aspirants of competitive exams SSC, UPSC, Railways, Postal Assistants, Bank, GATE and NET

Q.

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)

Answer & Explanation

Answer: Option [C]

The tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes O(n)

In binary search tree to insert an object we first search the object from the root and always insert at the leaf.

For an unbalanced binary search tree all the nodes are required to traverse to insert as child after the last leaf.

So the required answer is O(n)

Computer Science Books

Your Valuable Comments Please...

Please Like Us
Brand