判断题：In a tree of degree d>2, if n1 = 1, then ...

In a tree of degree $$d>2$$, if $$n_1 = 1$$, then we must have $$\sum_{i=1}^{d}n_i > n_0$$, where $$n_i$$ is the number of degree $$i$$ nodes.



答案：FALSE