URI/1194.cpp at master · joaoferrete/URI · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <bits/stdc++.h>
using namespace std;

typedef struct no{
    char letra;
    struct no *dir, *esq;

    no(char letra){
        this->letra = letra;
        this->dir = NULL;
        this->esq = NULL;
    }
}no;

no * insereTree(no *raiz, char letra){
    if(raiz == NULL){
        raiz = new no(letra);

    }else if(letra < raiz->letra){
        raiz->esq = insereTree(raiz->esq, letra);
    }else{
        raiz->dir = insereTree(raiz->dir, letra);
    }
    return raiz;
}

vector <char> takeWhile(vector <char> s, char c){
    vector <char> v;
    for(int i = 0; i < s.size(); i++){
        if(s[i] == c){
            break;
        }
        v.push_back(s[i]);
    }
    return v;
}

vector <char> dropWhile(vector <char> s, char c){
    vector <char> v;
    int i;
    for(i = 0; i < s.size(); i++){
        if(s[i] == c){
            break;
        }
    }
    for(int j = i+1; j < s.size(); j++){
        v.push_back(s[j]);
    }
    return v;
}

no * recriaTree(vector <char> &prefixa, vector <char> &infixa){

    no *raiz = NULL;
    vector <char> dir, esq;

    if(prefixa.size() == 0 || infixa.size() == 0){
        return NULL;
    }

    char c = prefixa[0];
    prefixa.erase(prefixa.begin());

    raiz = new no(c);
    esq = takeWhile(infixa, c);
    dir = dropWhile(infixa, c);

    raiz->esq = recriaTree(prefixa, esq);
    raiz->dir = recriaTree(prefixa, dir);

    return raiz;
}

void printPostfix(no *raiz){
    if(raiz == NULL){
        return;
    }
    printPostfix(raiz->esq);
    printPostfix(raiz->dir);
    cout << raiz->letra;
}

void destroyTree(no *raiz){
    if(raiz == NULL){
        return;
    }
    destroyTree(raiz->esq);
    destroyTree(raiz->dir);
    delete raiz;
}

int main(){
    int n, c;
    string a, b;

    cin >> n;
    while(n--){
        cin >> c;
        cin >> a >> b;
        vector <char> prefixa, infixa;
        for(int i = 0; i < a.size(); i++){
            prefixa.push_back(a[i]);
        }
        for(int i = 0; i < b.size(); i++){
            infixa.push_back(b[i]);
        }
        no *raiz = recriaTree(prefixa, infixa);
        printPostfix(raiz);
        cout << endl;
        destroyTree(raiz);

    }
}