In a complete k-ary tree every internal node has exactly k children or no child.The number pf leaves in such a tree with n internal nodes is
Answers
Answered by
0
Answer:
According to the given details, the number pf leaves in such a tree with n internal nodes is n(K-1)+1. When you have roots, you can find out just one node that is called leaf. From this place, “+1” formula part comes from the base case. When you k children to the nodes, you make internal root. After that, you can get the total leaves as n(k−1)+1=(k−1)+1=k.
Similar questions