Q. 7 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(Logn)
(C) O(n)
(D) O(nLogn)
Answer: (C)
Explanation:
Q. 7 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(Logn)
(C) O(n)
(D) O(nLogn)
Answer: (C)
Explanation:
