给定二叉树，采用链式结构存储，编写算法void DeGree(BTree *t),实现功能：统计二叉树中度为1的节点数目

void DeGree(BTree *t)
{
if(t==null)
return 0;
else if(t->lchild ==null&&t->rchild ==null)
return 0;
else if(t->lchild ==null&&t->rchild !=null)
return (1+DeGree(t->rchild));
else if(t->lchild !=null&&t->rchild ==null)
return (1+DeGree(t->lchild));
else
return DeGree(t->lchild)+DeGree(t->rchild);
}