ISRO Computer Science (CSE) 2013 - Question 32

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

Which of the following number of nodes can form a full binary tree?

  • A. 8
  • B. 15
  • C. 14
  • D. 13

Answer: B. 15

Explanation: A full binary tree (perfect) has $2^h - 1$ nodes. 15 is $2^4 - 1$.

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