PAT 1130. Infix Expression (25)

最新推荐文章于 2022-11-24 22:24:59 发布

hdvsyuxwetrwert

最新推荐文章于 2022-11-24 22:24:59 发布

阅读量260

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/qq_22530055/article/details/68927222

版权

PAT 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

通过寻找根节点的下标来划分左右子树，递归打印

#include <iostream>
#include <string>

using namespace std;

struct Node {
    string data;
    int leftChildIndex, rightChildIndex;
};

struct Node *nodes;

int rootIndex(bool *index, int n) {
    for (int i = 1; i <= n; i++) {
        if (index[i] == false) {
            return i;
        }
    }
    return -1;
}

void printTree(int rootIndex) {
    int left = nodes[rootIndex].leftChildIndex;
    if (left != -1) {
        if (nodes[left].leftChildIndex != -1) printf("(");
        printTree(nodes[rootIndex].leftChildIndex);
        if (nodes[left].leftChildIndex != -1) printf(")");
    }
    cout << nodes[rootIndex].data;
    int right = nodes[rootIndex].rightChildIndex;
    if (right != -1) {
        if (nodes[right].rightChildIndex != -1) printf("(");
        printTree(nodes[rootIndex].rightChildIndex);
        if (nodes[right].rightChildIndex != -1) printf(")");
    }
}

int main() {
    int n = 0;
    cin >> n;
    nodes = new struct Node[n + 1];
    bool *index = new bool[n + 1];
    for (int i = 1; i <= n; i++) {
        cin >> nodes[i].data >> nodes[i].leftChildIndex >> nodes[i].rightChildIndex;
        if (nodes[i].leftChildIndex != -1) index[nodes[i].leftChildIndex] = true;
        if (nodes[i].rightChildIndex != -1) index[nodes[i].rightChildIndex] = true;
    }
    int root = rootIndex(index, n);
    if (root == -1) {
        cout << "error";
    } else {
        printTree(root);
    }
    delete [] index;
    delete [] nodes;
    return 0;
}