计算二叉树中分支结点数的算法

//计算树中分支结点数int BranchNodes(BTNode *b){int num1,num2,n;if(b==NULL)return 0;else if(b->lchild==NULL && b->rchild==NULL)n=0;elsen=1;num1=BranchNodes(b->lchild);num2=BranchNodes(b->rchild);return (num1+num2+n);}