二叉树操作练习

#include<iostream>
#include "malloc.h"
#include "stdio.h"
using namespace std;


struct BiTNode{
int data;
BiTNode* lchild;
BiTNode* rchild;
};


BiTNode* CreatTree()
{
    BiTNode* T;
T = (BiTNode*) malloc(sizeof(BiTNode));
if(T != NULL)
   {   
  char ch;
  scanf("%c",&ch);
  //cin >> T->data;
  if(ch == '#') return NULL;
  T->data = ch;
  T->lchild = CreatTree();
  T->rchild = CreatTree();
   }
return T;


}
void Visit(BiTNode* T)
{
cout << T->data << " ";


}
void Preorder(BiTNode* T)
{
  if(T == NULL) return;
  Visit(T);
  Preorder(T->lchild);
  Preorder(T->rchild);
}




void main()
{
  
  BiTNode* T = CreatTree();
  Preorder(T);
  system("pause");


}