交换二叉树中所有节点的左右子树(共2页).doc

精选优质文档-倾情为你奉上#include#include#define max 10typedef struct nodechar data;node *lchild,*rchild;Bitree;Bitree *Bmax;Bitree *Creatree() /建立二叉树Bitree *T,*S;char ch;int front,rear,sign;sign=0;front=0;rear=-1;T=NULL;printf(建立二叉树:n);ch=getchar();while(ch!=#)if(ch!=)S=(Bitree *)malloc(sizeof(Bitree);S-data=ch;S-lchild=S-rchild=NULL;rear+;Brear=S;if(rear=front)T=S;