ISRO Computer Science (CSE) 2009 - Question 31

All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2009

A full binary tree with n leaves contains

  • A. n nodes
  • B. log2 n nodes
  • C. 2n - 1
  • D. 2^n nodes

Answer: C. 2n - 1

Explanation: In a full binary tree (where every node has 0 or 2 children), if there are L leaves, the total number of nodes N = 2L - 1.

| | All questions of ISRO Computer Science (CSE) 2009