二叉树找度数为1的节点

#include<stdio.h>
#include<stdlib.h>
#include
using namespace std;
#define NewNode (TreeNode *) malloc (sizeof(TreeNode))
int Count[100]={0},Max=0;
typedef struct node
{
char data;
node *Lchild,*Rchild;
} TreeNode;
TreeNode *Built()
{
TreeNode *T;
char ch;
cin>>ch;
if(ch==’#’)
T=NULL;
else
{
T=NewNode;
T->data=ch;
T->Lchild=Built();
T->Rchild=Built();
}
return T;
}
int Deep(TreeNode *&Tem)//找节点为1的树叶节点
{
if(TemNULL) return 0;
if((Tem->Lchild!=NULL)&&(Tem->RchildNULL))
{
return 1+Deep(Tem->Lchild)+Deep(Tem->Rchild);
}
if((Tem->Lchild==NULL)&&(Tem->Rchild!=NULL))
{
return 1+Deep(Tem->Lchild)+Deep(Tem->Rchild);
}

return Deep(Tem->Lchild)+Deep(Tem->Rchild);

}

void Num(TreeNode *&T,int i)
{
if(T!=NULL)
{
Count[i]++;//第i层结点数+1
Max=max(Max,Count[i]);
Num(T->Lchild,i+1);//T的左孩子，层数+1
Num(T->Rchild,i+1);//T的右孩子，层数+1
}
}
int main()
{
TreeNode *Root;
Root=Built();
cout<<Deep(Root);
return 0;
}