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? (GATE-2013)
| A. | O(1) |
| B. | O(log n) |
| C. | O(n) |
| D. | O(n log n) |
Answer : C Explanation : For skewed binary search tree on n nodes, the tightest upper bound to insert a node is O(n) |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
