Chapter 19, Problem 10RQE

Program Plan Intro

Binary tree:

A complete binary tree is a tree with the property that every node must have exactly two children, and in the last level the nodes should be from left to right.

Methods of traversing a binary tree:

There are three methods to traverse a binary tree. They are as follows:

• In-order traversal
• Pre-order traversal
• Post-order traversal

Post-order Traversal:

In the post-order traversal, initially,

• Traverse the left sub tree.
• Traverse the right sub tree.
• Visit the root node.

Ternary tree:

The ternary tree is similar to binary tree, but it contains the root node that is pointed to three children’s such as left node, middle node, and right node.