The Gateway to Computer Science Excellence

+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 |

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,385 answers

198,560 comments

105,390 users