If we implement heap as maximum heap, adding a new node of value 15 to the…

PYQ RSSB Computer Instructor 2022

If we implement heap as maximum heap, adding a new node of value 15 to the left most node of right subtree, what value will be at leaf nodes of the right subtree of the heap?

Max-heap tree: root 100; children 19 and 36; 19 has children 17 and 3; 17 has children 2 and 7; 36 has children 25 and 1.
  1. A.

    15 and 1

  2. B.

    25 and 1

  3. C.

    3 and 1

  4. D.

    2 and 3

Attempted by 276 students.

Sign up free to check your answer

Sign up free

Explore the full course: Rssb Senior Computer Instructor

Loading lesson…