Question: Suppose a heap is created by enqueuing elements in this order: 20, 18, 16, 14, 12. Then the order of the nodes in the underlying
Suppose a heap is created by enqueuing elements in this order: 20, 18, 16, 14, 12. Then the order of the nodes in the underlying binary tree, from level 0 to level 2, left to right, is:
| 20, 18, 16, 14, 12. | ||
| 12, 14, 16, 18, 20. | ||
| 20, 16, 18, 12, 14. | ||
| 18, 20, 12, 14, 16.
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
