The question is intended as a self-test for readers. Answers may be found in Appendix C.
The last node in a heap is
a. always a left child.
b. always a right child.
c. always on the bottom row.
d. never less than its sibling.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.