1 1 vote A full binary tree with $n$ leaves contains$n$ nodes $\log_{2} n$ nodes $2n –1$ nodes$2^{n}$ nodes Algorithms ugcnetcse-dec2014-paper2 algorithms binary-tree + – Misbah Ghaya 2.0k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 3 3 votes Answer : 2n-1 nodesA full binary tree is a tree in which every node other than the leaves has two children No of leavesNo of nodes Resultfirst diagram has 2 leaves total no of nodes is 3 2n - 1 = 2*2 - 1 = 3second 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 shekhar chauhan answered Jul 21, 2016 • edited Sep 20, 2025 by GO Classes shekhar chauhan comment Share Follow 0 reply Please log in or register to add a comment.
3 3 votes Ans C A full binary tree with nn leaves contains n-1 internal nodes. Total nodes= internal nodes + leaves = n-1 + n = 2n-1 sh!va answered Jul 21, 2016 sh!va comment Share Follow 0 reply Please log in or register to add a comment.
