void Free_Tree(BiTree &T)
{
if(T!=NULL)
{
Free_Tree(T->lchild);
Free_Tree(T->rchild);
free(T);
T=NULL;
}
}
void Delete_Tree(BiTree &T,char n)
{
if(T==NULL) return;
if(T->data==n)
{
Free_Tree(T);
}
if(T!=NULL)
{
Delete_Tree(T->lchild,n);
Delete_Tree(T->rchild,n);
}
}
void FirstTraver(BiTree T)
{
if(T)
{
cout<<T->data;
FirstTraver(T->lchild);
FirstTraver(T->rchild);
}
}