Use mathematical induction to prove that the number of leaves in a nonempty full K-ary tree is (K − 1)n + 1, where n is the number of internal nodes. Derive the formulae for computing the relatives of...

Use mathematical induction to prove that the number of leaves in a nonempty full K-ary tree is (K − 1)n + 1, where n is the number of internal nodes.

Derive the formulae for computing the relatives of a non-empty complete K-ary tree node stored in the complete tree representation of Section 5.3.3.