Computer Sciences > Gate 2015 Set-1 > Tree
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
A
63 and 6, respectively
B
64 and 5, respectively
C
32 and 6, respectively
D
31 and 5, respectively

Correct : Tree

Similar Questions

Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.
#601 Fill in the Blanks
Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.
#601 Fill in the Blanks
Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.
#601 Fill in the Blanks

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......