Question discussion

A full binary tree (every node has either 0 or 2 children) has 15 internal nodes. How many leaf nodes does it have?

1151Medium DSSSB TGT Computer Science 0 replies 1 views
0

A full binary tree (every node has either 0 or 2 children) has 15 internal nodes. How many leaf nodes does it have?

  • A14
  • B15
  • C30
  • D16
Correct answer: D

Explanation

In a full binary tree, leaves = internal nodes + 1 = 16.

Discussion 0

Nobody has replied yet. Start the discussion!