Problem
1. Which positions could be occupied by the 3rd largest key in a heap of size 32? Which positions could not be occupied by the 3rd smallest key in a heap of size 32?
2. Why not use a sentinel to avoid the j < n test in down heap?
3. Show how to obtain the functions of stacks and normal queues as special cases of priority queues.