Problem
1. Let T be a complete binary tree such that node v stores the entry (p(v), 0), where p(v) is the level number of v. Is tree T a heap? Why or why not?
2. Explain why the case where node r has a right child but not a left child was not considered in the description of down-heap bubbling.