1102 Invert a Binary Tree (25 分)

最新推荐文章于 2021-01-29 16:25:28 发布

NCY_92377

最新推荐文章于 2021-01-29 16:25:28 发布

阅读量206

点赞数

分类专栏： PAT 文章标签：二叉树中序遍历层次遍历反转二叉树

本文链接：https://blog.csdn.net/weixin_36313227/article/details/89763626

版权

PAT 专栏收录该内容

71 篇文章 0 订阅

订阅专栏

1102 Invert a Binary Tree (25 分)

The following is from Max Howell @twitter:

Google: 90% of our engineers use the software you wrote (Homebrew), but you can't invert a binary tree on a whiteboard so fuck off.

Now it’s your turn to prove that YOU CAN invert a binary tree!

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10) which is the total number of nodes in the tree – and hence the nodes are numbered from 0 to N−1. Then N lines follow, each corresponds to a node from 0 to N−1, and gives the indices of the left and right children of the node. If the child does not exist, a - will be put at the position. Any pair of children are separated by a space.

Output Specification:

For each test case, print in the first line the level-order, and then in the second line the in-order traversal sequences of the inverted tree. There must be exactly one space between any adjacent numbers, and no extra space at the end of the line.

Sample Input:

8
1 -
- -
0 -
2 7
- -
- -
5 -
4 6

Sample Output:

3 7 2 6 4 0 5 1
6 5 7 4 3 2 0 1

题意

invert——反转二叉树
然而开始并没有看到这个invert，于是噼里啪啦写完之后，发现答案完全不对，然后把答案画了画和自己的对照才发现它的左右节点反转了
于是以为题目是先输入右节点再输入左节点，于是就修改下面的地方：
```
scanf("%c%c%c",&r,&ch,&l);
```

是的，仅仅将左右节点输入对调

一顿操作猛如虎，就这样AC了
常规思路下次再写吧QAQ

code

#include<iostream>
#include <bits/stdc++.h>
using namespace std;

struct node
{
    //int data;
    int l_child, r_child;
}Node[11];

int n;
int in[11];
int num = 0;

void levelOrder(int root);
void inOrder(int root);

int main()
{
    char l,r,ch;
    int root;
    scanf("%d",&n);
    for(int i = 0; i < n; i++){
        getchar();
        scanf("%c%c%c",&r,&ch,&l);
        Node[i].l_child = l=='-'? -1 : l - '0';
        Node[i].r_child = r=='-'? -1 : r - '0';
        if(Node[i].l_child != -1){
            in[Node[i].l_child]++;
        }
        if(Node[i].r_child != -1){
            in[Node[i].r_child]++;
        }
    }
    for(int i = 0; i < n; i++){
        if(in[i]==0) {
            root = i;
            break;
        }
    }
    levelOrder(root);
    putchar('\n');
    num = 0; //
    inOrder(root);
    return 0;
}

void levelOrder(int root)
{
    queue<int> q;
    q.push(root);
    num = 0;
    while(!q.empty()){
        int now = q.front();
        q.pop();
        printf("%d",now);
        num++;
        if(num < n) printf(" ");
        if(Node[now].l_child != -1) q.push(Node[now].l_child);
        if(Node[now].r_child != -1) q.push(Node[now].r_child);
    }
}

void inOrder(int root)
{
    if(root == -1) return;
    inOrder(Node[root].l_child);
    num++;
    printf("%d",root);
    if(num < n) printf(" ");
    inOrder(Node[root].r_child);
}