Chapter 17, Problem 1RE

Explanation of Solution

Tree:

• A data structure that is present in the hierarchical form and is composed of nodes.
• Each of the node will be having a sequence of child nodes and also one of the node is considered to be a root node.

Possible shape of height h with one leaf:

The only possible shape of height ‘h’ level tree which has only one leaf at the end. The shape is shown below:

In the above diagram the nodes are represented using numeric values for easier recognition. The node numbered h is a leaf node and the height of the tree is h.

Possible shape of height 2 with K leaf:

The only possible shape of two level tree which has leaf nodes at its 2^nd level. The shape is shown below:

In the above diagram the nodes are represented using numeric values for easier recognition. The node numbered 2, 3, and h are considered as a leaf node and the height of the tree is 2.