Arnold F. answered • 10/21/15

Tutor

5
(53)
College Professor & Expert Tutor In Statistics and Calculus

In a full binary tree if a node has a left subtree it must have a right subtree.

Try writing them out as trees. If h(T) =n then the maximum number of nodes on any path from the root to the node on the tip of a subtree is n+1 (remember a tree of zero height is the root and it has one node) but t's possible not every path has the maximum.

Questions? comment back