Question

Explain in detail that if m pointer fields are set aside in each node of a general m-ary tree to point to a maximum of m child nodes, and if the number of nodes in the tree is n, the number of null child pointer fields is n*(m-1)+1.

EXPERT ANSWER

A tree is by definition an associated (thus non-void) chart G without cycles. Here is a proof by acceptance of the number