Current location - Training Enrollment Network - Mathematics courses - The tree T of highly decomposed discrete mathematical problems has two 2-degree nodes, 1 3-degree nodes, three 4-degree nodes, and the rest are leaves. How many leaves are there?
The tree T of highly decomposed discrete mathematical problems has two 2-degree nodes, 1 3-degree nodes, three 4-degree nodes, and the rest are leaves. How many leaves are there?
Let a tree T have two 2-degree nodes, 1 3-degree node, three 4-degree nodes, and the rest are leaves. How many leaves are there?
There are x leaves, which are 2 * 2+1* 3+3 * 4+x = (2+1+3+x-1) * 2.
So: x = 9
It is recommended to ask only one question at a time.
The answer is not easy, please adopt it in time, thank you!