printf("按先序次序输入二叉树中结点的值,输入0表示节点为空,输入范例:1 2 0 0 3 0 0\n"); gettree(T); printf("先序递归遍历二叉树:\n"); PreOrderTraverse(T); printf("\n"); printf("中序递归遍历二叉树:\n"); InOrderTraverse(T); printf("\n"); printf("后序递归遍历二叉树:\n");...
数{if(T==NULL)return;else{if(T->lchild&&T->rchild)sum2++;elseif((T->lchild&&!T->rchild)||(!T->lchild&&T->rchild))sum1++;elseif(!T->lchild&&!T->rchild)sum0++;Degree(T->lchild);Degree(T->rchild);}}intHigh(TreeT)//求树高{if(T==NULLnum1High(T->lchild);num2=High(T-...