二叉树的递归遍历

#define   _CRT_SECURE_NO_WARNINGS
#include<iostream>

using namespace std;

typedef struct TreeNode
{
char Data;
TreeNode* Left;
TreeNode* Right;
}*BinTree;

void CreateBinTree(BinTree &p)
{
char tmp;
scanf("%c", &tmp);
if (tmp != '#')
{
p = (BinTree)malloc(sizeof(TreeNode));
p->Data = tmp;
CreateBinTree(p->Left);
CreateBinTree(p->Right);
}
else
{
p = NULL;
}
}
void PreOrderTraversal(BinTree T)
{
if (T)
{
printf("%c",T->Data);
PreOrderTraversal(T->Left);
PreOrderTraversal(T->Right);
}
}
void InOrderTraversal(BinTree T)
{
if (T)
{
InOrderTraversal(T->Left);
printf("%c", T->Data);
InOrderTraversal(T->Right);
}
}
void PostOrderTraversal(BinTree T)
{
if (T)
{
PostOrderTraversal(T->Left);
PostOrderTraversal(T->Right);
printf("%c", T->Data);
}
}
int main()
{
BinTree T = NULL;
printf("CreateBinTree\n");
CreateBinTree(T);
printf("\nPreOrderTraversal\n");
PreOrderTraversal(T);
printf("\nInOrderTraversal\n");
InOrderTraversal(T);
printf("\nPostOrderTraversal\n");
PostOrderTraversal(T);
return 0;
}