Chapter 20, Problem 1RQE

Explanation of Solution

Binary tree

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

• First node must be the root of the tree.
• The second node must be the left child of the root
• The third node must always be the right child of the root.
• The next node must start to fill the next level from left to right.

The diagrammatic representation is as follows:

Therefore, every node in the binary tree points to exactly “zero or one or two” nodes in a tree.