Question: a k-ary tree (k >= 2) is an ordered tree with at most k ordered children per node and each child is distinguished as the ith child for some 1 <= i <= k. Thus, a tree is a 2-ary tree.
Part 1) How many k-ary trees are there with 2 nodes?
Part 2) extend the concepts of full, perfect, and complete binary trees to k-ary trees
Part 3) How many nodes ndoes a perfect k-ary tree of height h have and why?
Part 4) What are the bounds on the number of nodes of a complete k-ary tree of height h. Give examples of two extremes.
Part 5) find an expression for the relation between the number of leaves and non-leaves in a full k-ary tree and prove your expression is correct
Describe each and every question in depth with examples.