a) 15 and 1
b) 25 and 1
c) 3 and 1
d) 2 and 3
If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!