Question

Show that a strictly binary tree having exactly k parent vertices has exactly k + 1 leaves.

Answer 1

n a complete k-ary tree, every internal node has exactly k children or no child. The number of leaves in such a tree with n internal nodes is: ...kn

pls mark as brainliest