HELPPPPPPPP
1 answer:
You might be interested in
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 =
Substitute h = 5
The maximum number of nodes in a binary tree of height 5 =
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
