二叉树的基本操作

#include<iostream>
#include<stdlib.h>
#include<cmath>
using namespace std;
int len=0;

struct Stack
{
	int s[1000];
	int top; 
};

struct BiTNode
{
	char data;
	BiTNode *LChild;
	BiTNode *RChild;
};

void Create(BiTNode *&T)
{
	char ch;
	cin>>ch;
	if(ch=='#')
	T=NULL;
	else
	{
		T=(BiTNode*)malloc(sizeof(BiTNode));
		T->data=ch;
		Create(T->LChild);
		Create(T->RChild);
	}
}

void PreOrder(BiTNode *T)
{
	if(T!=NULL)
	{
		cout<<T->data;
		PreOrder(T->LChild);
		PreOrder(T->RChild);
	}
}

void MidOrder(BiTNode *T)
{
	if(T!=NULL)
	{
		MidOrder(T->LChild);
		cout<<T->data;
		MidOrder(T->RChild);
	}
}

void PostOrder(BiTNode *T)
{
	if(T!=NULL)
	{
		PostOrder(T->LChild);
		PostOrder(T->RChild);
		cout<<T->data;
	}
}

void PreLeaf(BiTNode *T)
{
	if(T!=NULL)
	{
		if(T->LChild==NULL&&T->RChild=