If T is a binary tree that has t leaves and height h, then t and h are related by the inequality .
To fill the blank in the statement, “If
Given information:
If this rooted tree is a binary tree, in a particular level the maximum number of vertices we obtain is
By the height of a rooted tree we denote the maximum number of levels