The worst case running time to search for an element in a balanced binary…

PYQ GATE 2012

The worst case running time to search for an element in a balanced binary search tree with n2nn2^n elements is

  1. A.

    Θ(n log n)Θ (n \ log \ n)

  2. B.

    Θ(n2n)Θ (n2^n)

  3. C.

    Θ(n)Θ (n)

  4. D.

    Θ(log n)Θ (log \ n)

Attempted by 844 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…