Total questions: 1
Time alloted : 25 minutes
Use ctrl + to increase font size Start Test
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)
O(1)
O(log n)
O(n)
O(n log n)
For skewed binary search tree on n nodes, the tightest upper bound to insert a node is O(n)
Quick links
Do not have an account? Register