In each of 4—20, either draw a graph with the given specifications or explain why no such graph exists.

13. Binary tree, height 4, eight leaves

Draw a graph with the given specifications or explain the reason if no such graph exists.

Given information:

Binary tree, height 4, eight terminal vertices.

Concept used:

The maximum level of any vertex of a rooted tree is known as the height of the tree.

Calculation:

For any binary tree T with height h and terminal vertices t, we have t≤2h for all integer h≥0.

Thus, the total no. of the terminal vertices of height four is

t=24=16

Thus, the binary tree having height 4 and 8 terminal vertices will exist