Leaf nodes

• Theorem 9.3 : Consider an N-ary tree of height h >= 0. The maximum number of leaf nodes in T is

N

h

Previous slide

Next slide

Back to first slide

View graphic version