Answer:
Height = 5
Minimum number of vertices in a binary tree
whose height is h.
So, there must be At least one node at each of first h levels.
Minimum number of vertices = h
So, Minimum number of vertices of height 5 is 5
The maximum number of nodes in a binary tree of height h = [tex]2^{h+1}- 1[/tex]
Substitute h = 5
The maximum number of nodes in a binary tree of height 5 = [tex]2^{5+1}- 1[/tex]
The maximum number of nodes in a binary tree of height 5 = 63
So, the maximum number of vertices in a binary tree with height 5 is 63
