Chapter 20, Problem 14RQE

Explanation of Solution

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

Pre-order Traversal:

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

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 PreOrder

Algorithm:

if T is not empty then

...