Q105
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.
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
AnswerB.
25 and 1
C.
3 and 1
D.
2 and 3
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board