Semantic Analysis19

0. 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?

Answer
Comment
Array

Option : C
Explanation :
For skewed binary search tree on n nodes, the tightest upper bound to insert a node is O(n)

Forgot your password?

I agree with the Terms.