PAT：1102 Invert a Binary Tree (25分)

最新推荐文章于 2022-07-11 16:03:39 发布

从舟

最新推荐文章于 2022-07-11 16:03:39 发布

阅读量59

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/qq_43501398/article/details/105303626

版权

PAT 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct node{
	int val,index;       //leve作为参数，遍历得到   index至关重要，保证了由中序得到层序的稳定性
	int left,right,leve;
}tree[12];
int exist[12],root = -1;
vector<node>in;
int le[12];
bool cmp(node a,node b){     //层序的关键代码
	if(a.leve != b.leve)return a.leve < b.leve;
	else return a.index < b.index;
}
void inorder(int root,int level){
	if(root != -1){
		inorder(tree[root].right,level+1);
		tree[root].leve = level;
		in.push_back(tree[root]);
		inorder(tree[root].left,level+1);
	}
}
int main(){
	int n;
	string s;
	cin >> n;
	getchar();
	for(int i = 0;i < n;i++){
		int l=0,r=0;
		getline(cin,s);
		if(s[0] == '-')
		    l = -1;
		else{
			l = s[0] - '0';
	    	exist[l] = 1;
		} 
	    if(s[2] == '-')
		    r = -1;
		else{
			r = s[2] - '0';
	    	exist[r] = 1;
		} 
		tree[i].left = l;
		tree[i].right = r;
		tree[i].val = i;
	}
	int i;
	for(i = 0;i < n;i++)
	   if(exist[i] == 0)root = i;
	inorder(root,1);
    for(int i = 0;i < n;i++){
    	le[i] = in[i].val;
    	in[i].index = i;
	}
	sort(in.begin(),in.end(),cmp);
	for(int i = 0;i < n;i++)printf("%d%s",in[i].val,i == n-1 ? "\n" : " ");
	for(int i = 0;i < n;i++)printf("%d%s",le[i],i == n-1 ? "\n" : " ");
	return 0;
}