Consider a binary min-heap containing 105 distinct elements. Let 𝑘 be the…

GATE · 2024 · CS · Set 1 · Computer Science & IT

Consider a binary min-heap containing 105 distinct elements. Let 𝑘 be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of 𝑘 is

  1. A.

    53

  2. B.

    52

  3. C.

    27

  4. D.

    1

Attempted by 342 students.

Show answer

Correct answer: A

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

Loading lesson…