Menu
Home / GATE 2017-2018 / GATE CSE :: Discussion

Discussion :: GATE CSE

  1. 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?
    2. A.
    O(1)
    B.
    O(log n)
    C.
    O(n)
    D.
    O(n log n)

    View Answer

    Workspace

    View Answer

    Answer : Option C

    Explanation :

    -NA-

Write your comments here:

Be The First To Comment