1.树的出度=树的入度=树的节点数-1;n0=5,n1=3,n2未知;树的出度=0*n0+1*n1+2*n2=n0+n1+n2-1得n2=4;故树的总节点数为:5+3+4=12
2.叶子节点个数=度为2的结点个数加1
1.树的出度=树的入度=树的节点数-1;n0=5,n1=3,n2未知;树的出度=0*n0+1*n1+2*n2=n0+n1+n2-1得n2=4;故树的总节点数为:5+3+4=12
2.叶子节点个数=度为2的结点个数加1
转载于:https://my.oschina.net/u/4120977/blog/3101649