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(long)
C
O(n)
D
O(long)
Correct Answer: O(n)
For skewed binary search tree on n nodes, the upper bound to insert a node is O (n).