C语言二叉树建立、遍历、交换子树代码.docVIP

C语言二叉树建立,遍历(递归与非递归),交换子树(代码） //C版二叉树建立,遍历(递归与非递归),交换子树#includeiostream#includequeue#includestackusing namespace std;//建树typedef struct Node{?int data;?Node *lchild,*rchild;}btree;btree *create(int a[],int n,int i){?btree *t;?if(in)??t=NULL;?else?{??t=new btree;??t-data=a[i-1];??t-lchild=create(a,n,2*i);??t-rchild=create(a,n,2*i+1);?}?return t;}//前序遍历(递归）void preorder(btree *p){?if(p!=NULL)?{???? coutp-dataendl;??preorder(p-lchild);??preorder(p-rchild);?}}//前序遍历（非递归）void preorder1(btree *p){?stackbtree * s;?while(!s.empty()||p!=NULL)?{??while(p!=NULL)??{???coutp-dataendl;//该语句在中序遍历中的位置不同????? s.push(p);???p=p-lchild;??}??p=s.top();??s.pop();??p=p-rchild;?}} //中序遍历(递归）void inorder(btree *p){?if(p!=NULL)?{??inorder(p-lchild);??coutp-dataendl;??inorder(p-rchild);?}}//中序遍历（非递归）void inorder1(btree *p){?stackbtree * s;?while(!s.empty()||p!=NULL)?{??while(p!=NULL)??{???s.push(p);???p=p-lchild;??}??p=s.top();??coutp-dataendl;//该语句在前序遍历中的位置不同??s.pop();??p=p-rchild;?}} //后序遍历(递归）void postorder(btree *p){?if(p!=NULL)?{??postorder(p-lchild);??postorder(p-rchild);??coutp-dataendl;?}}//后序遍历（非递归）struct node{?btree *t;?int flag;};void postorder1(btree *p){?stacknode s;?node post;?while(!s.empty()||p!=NULL)?{??while(p!=NULL)??{???? ?post.t=p;???? ?post.flag=0;???? ?s.push(post);??? ??p=p-lchild;??}??if(!s.empty())??{???post=s.top();???s.pop();???if(post.flag==0)???{????post.flag=1;????s.push(post);????p=(post.t)-rchild;???}???else???{????cout(post.t)-dataendl;????p=NULL;???}??}//if?}//while????} //层次遍历(非递归）void layerorder(btree *p){?queuebtree * q;?btree *t;?if(p!=NULL)??q.push(p);?while(!q.empty())?{??t=q.front();??coutt-dataendl;??q.pop();??if(t-lchild!=NULL)????? q.push(t-lchild);??if(t-rchild!=NULL)???q.push(t-rchild);?}} //对二叉树 t 中所有结点的左右子树进行交换void exchange(btree *p){?btree *t;?if(p!=NULL)?{??? ?t=p-lchild;??? ?p-lchild=p-rchild;?