In each of 4—20, either draw a graph with the given specifications or explain why no such graph exists.
4. Full binary tree. five internal vertices
Draw a graph with the given specifications or explain the reason if no such graph exists.
Given information:
Full binary tree. five internal vertices.
Concept used:
A full binary tree has a total of
An internal vertex of a binary tree has two siblings. Thus, each and every five internal vertices of full binary tree has two siblings