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

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

  1. a) (n-1)k+1
  2. b) nk
  3. c) n(k-1)
  4. d) n(k-1)+1

From the BB Assistant Programmer February 2023 – Written (BIBM) exam, question 12 of 37.

More from this paper