Chapter 20, Problem 15RQE

Explanation of Solution

Pseudocode algorithm for post-order traversal of a binary tree:

Post-order Traversal:

In the post-order traversal, initially it traverses the left sub tree, then traverses the right sub tree and finally visit the root node.

Pseudocode:

In this algorithm, recursion of binary tree “T” is “T’”, let us consider “N” denote the root of a subtree of “T’”, “L” is the subtree of “T’”, whose root is the left child of “N”, and “R” be the subtree of “T’”, whose root is the right child of “N”.

Input: T, a binary tree

Output: The contents of the nodes of T displayed in PostOrder...