互换二叉树的左右子树.doc

#include#include#include#define TRUE 1#define FLASE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int TElemType;typedef struct BiTNodeTElemType data;struct BiTNode *lchild,*rchild; BiTNode,*BiTree;Status CreateBiTree(BiTree &T)TElemType e;scanf(%d,&e);if(e=0) T=NULL;else T=(BiTree)malloc(sizeof(BiTNode);if(!T)exit(OVERFLOW);T-data =e;CreateBiTree(T-lchild );CreateBiTree(T-rchild );return OK;Status PrintElement (TElemType e)printf(%d ,e);return OK;Status PreOrderTraverse (BiTree T,Status (* Visit) (TElemType)if(T)if(Visit(T-data )if(PreOrderTraverse(T-lchild ,Visit)if(PreOrderTraverse(T-rchild ,Visit)return OK;return ERROR;elsereturn OK;Status InOrderTraverse (BiTree T,Status (* Visit) (TElemType)if(T)if(InOrderTraverse(T-lchild ,Visit)if(Visit(T-data )if(InOrderTraverse(T-rchild ,Visit)return OK;return ERROR;elsereturn OK;Status PostOrderTraverse (BiTree T,Status (* Visit) (TElemType)if(T)if(PostOrderTraverse(T-lchild ,Visit)if(PostOrderTraverse(T-rchild ,Visit)if(Visit(T-data )return OK;return ERROR;elsereturn OK;Status Exchangechild (BiTree &T)BiTree temp;if(T)temp=T-lchild ;T-lchild =T-rchild ;T-rchild =temp;Exchangechild(T-lchild );Exchangechild(T-rchild );return OK;else return ERROR;void main()BiTree T;printf(请输入树中节点的值（int型），0表示空树:n);CreateBiTree(T);Exchangechild(T);printf(互换左右子树后，二叉树的先序输出是:n); PreOrderTraverse(T,PrintElement);printf