InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
Consider the binary min heap given below:(min heap is a binary tree where each node in a tree has a key which is less than or equal to the key of its children)Insert the key 1 in above min heap which of the following is the resulantmin heap after two delete operations? |
Answer» Consider the binary min heap given below:(min heap is a binary tree where each node in a tree has a key which is less than or equal to the key of its children)Insert the key 1 in above min heap which of the following is the resulantmin heap after two delete operations? |
|