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?

- A.
15 and 1
- B.
25 and 1
- C.
3 and 1
- D.
2 and 3
Attempted by 276 students.
Sign up free to check your answer
Sign up freeLoading lesson…

