MCQOPTIONS
Saved Bookmarks
| 1. |
What does this pseudo_code return ? int myfun(heap_arr[]) { int mini=INF; for(int i=0;i<tot_node;i++) mini=min(mini,heap_arr) return mini; } |
| A. | Last added element to heap |
| B. | First element added to heap |
| C. | Root of the heap |
| D. | Leftmost node of the heap |
| Answer» D. Leftmost node of the heap | |