6 votes 6 votes Q.A strictly binary tree with 10 leaves A) cannot have more than 19 nodes B) has exactly 19 nodes C)has exactly 17 nodes D) has exactly 20 nodes Programming in C isro2017 non-gate + – junaid ahmad asked Dec 17, 2017 junaid ahmad 7.3k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Ashwin Kulkarni commented Dec 17, 2017 reply Follow Share Exactly 19 nodes. 1 votes 1 votes Hemant Parihar commented Dec 17, 2017 reply Follow Share Strictly binary tree means a node can have 2 or 0 children only. All the internal node will have 2 children. We have 10 leaves node. So the internal node which has two children will be 1 less than no. of leaves. And Here we don't have a node which has one child. Total nodes = 10 + 9 = 19. 3 votes 3 votes Please log in or register to add a comment.
Best answer 5 votes 5 votes Ans.B) has exactly 19 nodes A strictly binary tree with N leaves always contains 2N – 1 nodes. 10*2-1=19 nodes Raushank2 answered Dec 17, 2017 • selected Dec 17, 2017 by Tesla! Raushank2 comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes strict binary tree have o or 2 children abhishekmehta4u answered Mar 13, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes If every non-leaf node in a binary tree has nonempty left and right subtrees, the tree is called a strictly binary tree. A strictly binary tree with n leaves always contains 2n -1 nodes. 10*2 - 1 = 19 pankaj_vir answered Mar 13, 2018 pankaj_vir comment Share Follow See all 0 reply Please log in or register to add a comment.
