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.
Correct Answer: A
None.
report Report Error
Select Issue Type
Selected Issue
forum Community Discussion
speaker_notes_off
No discussions yet. Be the first to start!
syncLoading more...
You must be logged in to participate in the discussion.
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.
