Height of a tree
Computer Science
Level
3
The height of a tree is the length of the longest root-to-leaf path in it. What are the maximum and minimum numbers of nodes, respectively, of a binary tree with height 8?
511, 9
255, 8
256, 8
512, 9
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Full binary tree of height n has 2^(n+1)-1 nodes. Or it is a 1 path vith 9 nodes.