Consider the process of inserting an element into a Max Heap, where the Max…

PYQ GATE 2007

Consider the process of inserting an element into a Max Heap, where the Max Heap is represented by an array. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of comparisons performed is:

  1. A.

    θ(logn)

  2. B.

    θ(loglogn )

  3. C.

    θ(n)

  4. D.

    θ(nlogn)

Attempted by 504 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…