Chapter A, Problem 9E

a.

Explanation of Solution

Algorithm for inorder traversal:

The algorithm of inorder traversal is similar to the algorithm of preorder traversal except printing the node. In inorder traversal, the node is printed after visiting its sub tree and the algorithm for inorder traversal is as follows

TreeNode: node

Boolean: done

Stack: stack

Node root

...

b.

Explanation of Solution

Algorithm for postorder traversal:

The algorithm of postorder traversal is different from the algorithms of preorder and inorder traversals. In postorder traversal, the parent node is visited twice whereas in preorder and inorder traversals, it is visited only once and the algorithm for postorder traversal is as follows

TreeNode: node

Boolean: done

Stack: stack

Node root

Done FALSE

While NOT ...