2 votes 2 votes Unknown Category binary-tree algorithms flip-flop + – sh!va asked Jun 4, 2016 sh!va 1.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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. vijaycs answered Jun 4, 2016 vijaycs comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Tauhin Gangwar answered Jun 4, 2016 Tauhin Gangwar comment Share Follow See all 0 reply Please log in or register to add a comment.