Multiple choice

A full binary tree with 'n' leaves contains

  1. n nodes

  2. log2 n nodes

  3. 2n-1 nodes

  4. 2n nodes

Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

In a full binary tree, every node has either 0 or 2 children. For a full binary tree with n leaves, the total number of nodes is always 2n - 1.