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

12. Full binary tree, eight internal vertices, seven leaves

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

Given information:

Full binary tree, eight internal vertices, seven terminal vertices.

Concept used:

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

Calculation:

There is no full binary tree with 8 internal vertices and 7 terminal vertices.

Because any full binary tree has 2k+1 vertices, where k is the number of internal vertices