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 T is a binary tree that has t leaves and height h, then t and h are related by the inequality ______.”

Given information:

T is a binary tree with t number of leaves and the height is h.

If this rooted tree is a binary tree, in a particular level the maximum number of vertices we obtain is 2 to the power of the level number. For an example, consider the level number one of a binary tree. Then, the parent vertex would be the root and the maximum number of children is 2. Hence,

The number of vertices in level 1≤21

By the height of a rooted tree we denote the maximum number of levels