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

GATE · 2007 · CS

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:

A.
θ(logn)
B.
θ(loglogn )
C.
θ(n)
D.
θ(nlogn)

Attempted by 399 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2