1,047 views
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?

1 Answer

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
selected by

Related questions

0 votes
0 votes
0 answers
1
Nandkishor3939 asked Jan 25, 2019
466 views
Number of labelled subgraphs possible for the graph given below______________
0 votes
0 votes
2 answers
2
sripo asked Dec 25, 2018
4,788 views
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?Does it vary for binary tree?What do you mean by internal nodes? Non roo...
20 votes
20 votes
1 answer
3
Lakshman Bhaiya asked Oct 16, 2018
5,101 views
Find the number of Topological order(sort) in the given graph?$(1)$$(2)$
1 votes
1 votes
0 answers
4
Balaji Jegan asked Jun 4, 2018
1,085 views
How many max-heaps can be formed with the following elements?$\{1,1,1,2,2,2,3,3,3,4,4,4\}$