二叉树的#号创造法

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
//二叉树的节点
typedef struct BinaryNode()
{
char ch;
struct BINARYNODE*lchild;
struct BINARYNODE*rchild;
};
void Recursion(BinaryNode*root)
{
if(NULL == root)
{
return;
}
printf("%c",rott->ch);
Recursion(root->lchild);
Recursion(root->rchild);
}
BinaryNode* CreateBinaryTree()
{
fflush(stdin);
char ch;
scanf("%c");
BinaryNode*node;
//BinaryNode*rchild;
//BinaryNode*lchild;
if(ch == '#')
{
node =NULL;
}
else{
//lchild = CreateBinaryTree();
//rchild = CretaeBinaryTree();
node=(BinaryNode*)malloc(sizeof(BinaryNode));
node->ch=ch;
node->lchild=CreateBinaryTree();
node->rchild=CretaeBinaryTree();

}
return node;
}

int main()
{
//创建树
BinaryNode*root=CreateBinaryNode();
//打印树
Recursion(root);
system("pause");
return EXIT_SUCCESS;
}