题目链接:https://pintia.cn/problem-sets/994805342720868352/problems/994805365537882112
思路:就是二叉树先左右翻转,然后输出它的层序遍历和前序遍历
(英语不好的我把题目理解为把树翻转,然后层序遍历,接着,以最左子树的左结点为根进行中序遍历,我还去记录了一下父节点,真的是脑残了o(╥﹏╥)o)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
using namespace std;
vector <int> v1,v2;
struct Node{
int l,r;
};
Node a[220];
int vis[220];
void levelorder(int x)
{
queue <int> q;
q.push(x);
while(!q.empty())
{
int tp=q.front();
q.pop();
v1.push_back(tp);
if(a[tp].l!=-1) q.push(a[tp].l);
if(a[tp].r!=-1) q.push(a[tp].r);
}
}
void preorder(int x)
{
if(x!=-1)
{
preorder(a[x].l);
v2.push_back(x);
preorder(a[x].r);
}
}
int main(void)
{
int n,t1,t2,i;
char c1,c2;
scanf("%d",&n);
memset(vis,0,sizeof(vis));
for(i=0;i<n;i++)
{
getchar();
scanf("%c %c",&c1,&c2);
if(c1=='-') t1=-1;
else t1=c1-'0',vis[t1]=1;
if(c2=='-') t2=-1;
else t2=c2-'0',vis[t2]=1;
a[i].r=t1;a[i].l=t2;
}
int root;
for(i=0;i<n;i++)
if(vis[i]==0)
{
root=i;break;
}
v1.clear();v2.clear();
levelorder(root);
preorder(root);
for(i=0;i<v1.size();i++)
{
if(i) cout<<" ";
cout<<v1[i];
}
cout<<endl;
for(i=0;i<v2.size();i++)
{
if(i) cout<<" ";
cout<<v2[i];
}
cout<<endl;
return 0;
}