2 votes 2 votes In a binary tree if an element is it's own descendent(means 3 descendent of every node), then what is the number of descendent of leaf nodes? If there is any descendent of degree 0? DS data-structures + – srestha asked Nov 2, 2017 srestha 1.1k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Anu007 commented Nov 2, 2017 reply Follow Share Not possible of degree 0. Since every leaf is own descendent so each node has degree atleast 1. 1 votes 1 votes srestha commented Nov 2, 2017 reply Follow Share then chk here https://gateoverflow.in/2183/gate2010-10 It is telling leaf node have not even 1 child 0 votes 0 votes srestha commented Nov 2, 2017 i edited by srestha Nov 2, 2017 reply Follow Share but I havenot getting why they not taking 1 child for each leaf node?could u explain what u think correct? 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes An element is it's own decedendent and it's own ancestor In a binary tree a node (element) can have at least 1 decedendent and max is not 3 max is all possible child, grand child till depth of the tree from that node Tesla! answered Nov 2, 2017 • selected Nov 2, 2017 by srestha Tesla! comment Share Follow See all 15 Comments See all 15 15 Comments reply Show 12 previous comments joshi_nitish commented Nov 2, 2017 reply Follow Share leaf has one child means it's descendents are 2(one child and leaf itself)..... 1 votes 1 votes joshi_nitish commented Nov 2, 2017 reply Follow Share if leaf has 0 child means its descendents are 1(0 child + 1 leaf itself = 1) 1 votes 1 votes srestha commented Nov 2, 2017 reply Follow Share yes yes got it thank u all so much :) 0 votes 0 votes Please log in or register to add a comment.