Problem
1. In defining the relation "to the left of" for two nodes of a binary tree, can we use a preorder traversal instead of an inorder traversal? How about a postorder traversal?
2. Illustrate the execution of the heap-sort algorithm on the following input sequence: (2,5,16,4,10,23,39,18,26,15).