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
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
Thus, the total no. of the terminal vertices of height four is
Thus, the binary tree having height