The degree of a tree? (As in, a tree ADT)

binary-treedata-structurestree

I understand that the degree of a node is the number of children it has.

However, how do we define the degree of a tree?

Best Solution

Basically The degree of the tree is the total number of it's children i-e the total number nodes that originate from it.The leaf of the tree doesnot have any child so its degree is zero.

The degree of a node is the number of partitions in the subtree which has that node as the root. Nodes with degree=0 are called leaves.