#include <cstdio>
#include <queue>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
bool notroot[20] = {false};
queue<int>q;
int n=0,num=0;
struct node
{
int lc;
int rc;
}Node[20];
int strToNum(char c)
{
if(c == '-') return -1;
else if(c >= '0' && c <= '9')
{
notroot[c - '0'] = true;//**
return c - '0';
}
}
int findRoot()
{
for(int i = 0;i<n;i++)
{
if(notroot[i] == false)
return i;
}
}
void pos(int root)
{
if(root == -1) return;
pos(Node[root].lc);
pos(Node[root].rc);
swap(Node[root].lc,Node[root].rc);
}
void print(int id)
{
printf("%d",id);
num++;
if(num < n)
printf(" ");
else
{
num = 0;
printf("\n");
}
}
void level(int root)
{
q.push(root);
while(!q.empty())
{
int s = q.front();
q.pop();
print(s);
if(Node[s].lc != -1)
q.push(Node[s].lc);
if(Node[s].rc != -1)
q.push(Node[s].rc);
}
}
void in(int root)
{
if(root == -1) return;
in(Node[root].lc);
print(root);
in(Node[root].rc);
}
int main()
{
freopen("in.txt","r",stdin);
scanf("%d",&n);
for(int i = 0;i<n;i++)
{
char l,r;
scanf("%*c%c %c",&l,&r);
Node[i].lc = strToNum(l);
Node[i].rc = strToNum(r);
}
int root = findRoot();
pos(root);
level(root);
in(root);
}
1102 Invert a Binary Tree (25 分)(******)
猜你喜欢
转载自blog.csdn.net/qq_15556537/article/details/100127574
今日推荐
周排行