判断题：In a tree of degree 3, we have $$n_2+n_3 \ge n_0$$, where $$n_i$

In a tree of degree 3, we have $$n_2+n_3 \ge n_0$$, where $$n_i$$ is the number of degree $$i$$ nodes for $$0\le i\le 3$$.

答案：FALSE