Leaf node is a concept in discrete mathematics. Nodes in the tree that have no child nodes (that is, the degree is 0) are called leaf nodes, which are referred to as "leaves" for short. A leaf is a node with degree 0, also called a terminal node.
Extended data:
For example, if a tree has a degree of 4 and the number of nodes with degrees 1, 2, 3 and 4 are 4, 2, 1 and 1 respectively, what is the number of leaf nodes of the tree?
Solution: Because the total number of nodes in any tree = degree * the number of nodes corresponding to this degree+1, so:
Summary integral =1* 4+2 * 2+3 *1+4 *1+1=16.
Number of leaf nodes =16-4-2-1-1(total number of nodes-numbers with degrees other than 0) =8.
So: n0=8
Where: n0 represents a leaf node.