External and Internal Nodes

Theorem 9.1 (in your text) : An N-ary tree with n >= 0 internal nodes contains (N-1)(n+1) external nodes.

Theorem 9.2 : Consider an N-ary tree T of height h >= 0. The maximum number of internal nodes in T is given by

(h+1)

- 1

N - 1

Theorem 9.1 (in your text) : An N-ary tree with n >= 0 internal nodes contains (N-1)(n+1) external nodes.