1,372 views

2 Answers

4 votes
4 votes

Degree of a node - No of edges connected to the node.

node with 2 children has degree 3.( except root which has degree = 2).
node with 1 children has degree 2.( except root which has degree = 1).
leaf node has degree = 1.

1 votes
1 votes
Degree of a node in binary tree is the number of subtrees it have or we can say no .of childrens a node have,

a node with two chidren have 2 degree it can not have 3 degree...maximum degree of a binary tree is 2..

leaf node have 0 degree

Related questions

0 votes
0 votes
2 answers
1
sripo asked Dec 25, 2018
4,785 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...
2 votes
2 votes
1 answer
2
vijaycs asked May 25, 2016
12,811 views
3 votes
3 votes
1 answer
3
smartmeet asked Jul 29, 2016
496 views
Please make ​me clear about Descendants in Binary Trees.thanks in advance​
2 votes
2 votes
1 answer
4