A 5-ary tree is a rooted tree in which every vertex has at most 5 children. Suppose
Fantastic news! We've Found the answer you've been seeking!
Question:
A 5-ary tree is a rooted tree in which every vertex has at most 5 children. Suppose that T is a full 5-ary tree with ℓ leaves and p non-root parents. Prove that the number of leaves in T is ℓ = 4p + 5.
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: