# GATE Papers >> CSE >> 2013 >> Question No 7

Question No. 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?