-
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 ?
-
- O(1)
- O(log n)
- O(n)
- O(n log n)
- O(1)
Correct Option: C
The tightest upper bound that represents the time complexity of inserting an object into a binary search tree with n nodes is O (n).
