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

A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If L = 41, and I = 10, what is the value of n?radio_button_unchecked6radio_button_unchecked3radio_button_unchecked4radio_button_unchecked5

In a full binary tree if number of internal nodes is I, then number of leaves L are?OptionsL = 2*IL = I + 1 L = I – 1L = 2*I – 1

If a node has K children in a B tree, then the node contains exactly _______ Keys.

How many edges will a tree consisting of N nodes have?

The no.of external nodes in a full binary tree with n internal nodes