Share
Explore BrainMass

Trees

A. If T is a rooted binary tree of height 5, then T has at most 25 leaves.

b. If T is a tree with 50 vertices, the largest degree that any vertex can have is 49.

Solution Preview

--------------------------------------------------------
a. If T is a rooted binary tree of height 5, then T has at most 25 leaves.

...

Solution Summary

Questions involving trees are discussed.

$2.19