1. Because each non-root node has either two leaves or one leaf, at least one leaf, and a leaf has at most one leaf. The node with degree =n has the corresponding number of last leaves >; =n

2. The node with the largest degree must be the direct successor of the root node, otherwise there will be contradictions. Because if it is not a direct successor, its parent node has at least more leaves than it 1.

Therefore, the degree of the node with the "maximum" degree of these two trees =K- 1, so the number of leaves of these two trees >: 2*(K- 1)=2K-2.

3. Of course, the root node can also have other child nodes or leaf nodes, so

T total number of leaf nodes >; =2K-2

Obtain a certificate