/*
交换二叉树中所有结点的左右结点
*/
#include <iostream>
#include <cstdlib>
#include <deque>
using namespace std;
const int MAXSIZE = 100;
typedef char ElemType;
typedef struct BiTNode{
ElemType data;
struct BiTNode *lchild, *rchild;
}*BiTree;
//创建二叉树
void CreateTree(BiTree &t){
ElemType e;
cin >> e;
if(e=='#'){
t = NULL;
}else{
t = (BiTree)malloc(sizeof(BiTNode));
t->data = e;
CreateTree(t->lchild);
CreateTree(t->rchild);
}
}
//层次遍历
void PrintTreeByLevel(BiTree T)
{
if(T == NULL) return;
deque<BiTree> q;
q.push_back(T);
int curLevelNum; // 当前层的节点数
while (q.size())
{
curLevelNum = (int)q.size(); // 此处要做类型转换,因为size()返回值为size_type类型;
while(curLevelNum-- > 0) // 一直访问到当前层的最后一个节点
{
BiTree tmp = q.front();
q.pop_front();
printf("%c ", tmp->data);
if(tmp->lchild)
q.push_back(tmp->lchild);
if(tmp->rchild)
q.push_back(tmp->rchild);
}
printf("\n"); // 当前层的元素输出完毕后,换行;
}
}
//交换函数
void swapTree(BiTree &t){
BiTree p, stack[MAXSIZE];
int top;
if(t){
top = 1;
stack[top] = t;
while(top>0){ //栈不空
p = stack[top--]; //退栈并访问该结点
if(p->lchild && p->rchild){
ElemType e = p->lchild->data;
p->lchild->data = p->rchild->data;
p->rchild->data = e;
}
if(p->rchild) {
stack[++top] = p->rchild; //右孩子进栈
}
if(p->lchild){
stack[++top] = p->lchild;
}
}
}
}
int main(){
BiTree t;
cout << "请输入二叉树(先序,空树用#表示):";
CreateTree(t);
cout << "初始二叉树的层次遍历序列:" << endl;
PrintTreeByLevel(t);
cout << endl;
swapTree(t);
cout << "处理后的二叉树的先序遍历:" << endl;
PrintTreeByLevel(t);
cout << endl;
return 0;
}
交换二叉树中所有结点的左右结点
最新推荐文章于 2023-04-05 16:09:31 发布