Problem
1. Suppose you label each node v of a binary tree T with a key equal to the preorder rank of v. Under what circumstances is T a heap?
2. Illustrate the execution of the selection-sort algorithm on the following input sequence: (22,15,36,44,10,3,9,13,29,25).