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?
(B) O(log n)
(D) O(n log n)
Rewards per monthFirst Winner: 0 INR (Not Started)Second Winner: 0 INR (Not Started)
Show your Support. Become a FAN!