question archive Let T be a complete 4-ary rooted tree; that is, a rooted tree where every internal (non-leaf) vertex has 4 children
Let T be a complete 4-ary rooted tree; that is, a rooted tree where every internal (non-leaf) vertex has 4 children
Subject:MathPrice: Bought3
Let T be a complete 4-ary rooted tree; that is, a rooted tree where every internal (non-leaf) vertex has 4 children.
If h is the height of T, what are its minimum and maximum number of vertices?
This is a discrete math problem. No other information was given.
