Dark Mode

1,027 views

3 votes

Best answer

Answer : 2n-1 nodes

A full binary tree is a tree in which every node other than the leaves has two children

No of leaves | No of nodes | Result |

first diagram has 2 leaves | total no of nodes is 3 | 2n - 1 = 2*2 - 1 = 3 |

second diagram has 4 leaves | total no of nodes is 7 | 2n - 1 = 2*4 - 1 = 7 |

third diagram has 8 leaves | total no of nodes is 15 | 2n - 1 = 2*8 - 1 = 15 |