GATEverse
← GATE CSE 1998

Q2.11

MCQMarks unknown

A complete nn-ary tree is one in which every node has 00 or nn sons. If xx is the number of internal nodes of a complete nn-ary tree, the number of leaves in it is given by

Sign in to save attempts.

Loading…