/*
建立一棵二叉树,实现先序遍历,左右子树的交换和销毁二叉树的操作。
*/
#include <iostream>
#include<malloc.h>
using namespace std;
typedef struct BiTNode
{
char data;
struct BiTNode *lchild , *rchild ;//
}BiTNode,*BiTree;
void CreateBiTree(BiTree &T)//
{
char ch;
cin>>ch;
if(ch=='#')T=NULL;//#代表空指针
else
{
T=(BiTree )malloc(sizeof(BiTNode));
T->data=ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
void PreOrderTraverse(BiTree T)
{
if (T)
{
cout<<T->data<<" ";
PreOrderTraverse(T->lchild);
PreOrderTraverse(T->rchild);
}
}
void Changelrchild(BiTree &T)
{
BiTree temp;
if (T)
{
temp=T->lchild;
T->lchild=T->rchild;
T->rchild=temp;
Changelrchild(T->lchild);
Changelrchild(T->rchild);
}
}
void DestoryTree(BiTree &T)
{
if (T==NULL)
{
return ;
}
if (T)
{
DestoryTree(T->lchild);
DestoryTree(T->rchild);
}
free(T);
}
int main()
{
int i,j;
BiTree T,p;
while (1)
{
cout<<"建立一棵二叉树:"<<endl;
CreateBiTree(T);
cout<<"先序遍历二叉树:";
PreOrderTraverse(T);cout<<endl;
cout<<"交换两棵子树:"<<endl;
Changelrchild(T);
cout<<"先序遍历二叉树:";
PreOrderTraverse(T);cout<<endl;
cout<<"销毁二叉树:"<<endl;
DestoryTree(T);
}
return 0;
}