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

Discussion :: GATE CSE

  1. The worst case running time to search for an element in a balanced binary search tree with n2n elements is
    2. A.
    Θ (n log n)
    B.
    Θ (n2n)
    C.
    Θ (n)
    D.
    Θ (log n)

    View Answer

    Workspace

    View Answer

    Answer : Option C

    Explanation :

    -NA-

Write your comments here:

Be The First To Comment