GATE Computer Science (CS) 2013 Solved Paper

Question : 17 of 65

Marks: +1, -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?