遍历二叉树——统计结点个数

#include<stdio.h>
#include<stdlib.h>
typedef  struct NODE
{
char data;
struct NODE *Lchild;
struct NODE *Rchild;
}BiTree;
int hight=0;
int count=0;
BiTree *ChangeTree(BiTree *root)
{
char ch;
ch=getchar();
if(ch=='#')
root=NULL;
else
{
root=(BiTree *)malloc(sizeof(BiTree));
root->data=ch;
root->Lchild=ChangeTree(root->Lchild);
root->Rchild=ChangeTree(root->Rchild);
}
return root;
}


int PreOder(BiTree *root)
{
if(root)
{
printf("%c",root->data);
PreOder(root->Lchild);
PreOder(root->Rchild);
}
return 0;
}
int PreOder2(BiTree *root)
{
if(root==NULL)
return 0;
if(root->Lchild==NULL&&root->Rchild==NULL)
printf("%c",root->data);
PreOder2(root->Lchild);
PreOder2(root->Rchild);
}
 int Bianli(BiTree *root)
{


if(root)
{
count++;
Bianli(root->Lchild);
Bianli(root->Rchild);
}
return count;
}
 int Dutwo(BiTree *root)
 {
int n1,n2;
if(root==NULL)
return 0;
if(root->Lchild!=NULL&&root->Rchild!=NULL)
return 1;
n1=Dutwo(root->Lchild);
n2=Dutwo(root->Rchild);
return (n1+n2+1);
 }
int leaf(BiTree *root)
{
int n1,n2;
if(root==NULL)
return 0;
if(root->Lchild==NULL&&root->Rchild==NULL)
return 1;
n1=leaf(root->Lchild);
n2=leaf(root->Rchild);
return (n1+n2);
}
int main()
 {
int n,n1,n2,n3;
BiTree *root;
root=ChangeTree(&root);
n=Bianli(root);
n1=leaf(root); 
n2=Dutwo(root);
n3=n-n1-n2;
printf("%d %d %d\n",n1,n3,n2);
PreOder2(root);
printf("\n");
}