How to prove that the largest number of leaves in an $n$-tree of height $k$ is $k^n$?
Proving that the largest number of leaves in an $n$-ary tree of height $k$ is $k^n$
combinatorics;trees;discrete mathematics