Chapter 17.6, Problem 33SC

Explanation of Solution

Traversal of heap:

• The in-order traversal of the tree carries out by traversing left node, root and then right node of the tree.
• Pre-order maintains the order as root-left right.
• Post-order maintains the order as left-right root.

None of the traversal schemes prints the heap in sorted order.

Reason:

• The reason behind this that there is no rule to insert small values in left and big values in the right of the root...