Prove that there are at most mh leaves in an m-ary tree of height h.
Fantastic news! We've Found the answer you've been seeking!
Question:
Prove that there are at most mh leaves in an m-ary tree of height h.
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: