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?
Explanation: To insert an element, we need to search for its place first. The search operation may take O(n) for a skewed tree like following.
To insert 50, we will have to traverse all nodes. 10 \ 20 \ 30 \ 40