[BOJ] 트리순회

[문제]

https://www.acmicpc.net/problem/1991

1991번: 트리 순회

[풀이]

1991

맞았습니다!!

1988

0

C++14 / 수정

1183

9초 전

 

#include <iostream>
#include <vector>
 
using namespace std;
 
typedef pair<char, char> pp;
 
vector<pp> nodes[26]; //왼쪽, 오른쪽 노드를 담을 백터 배열
 
void preOrder(char root)
{
    char left = nodes[root - 'A'].front().first;
    char right = nodes[root - 'A'].front().second;
 
    cout << root ;
    if (left != '.')
        preOrder(left);
    if (right != '.')
        preOrder(right);
}
void inOrder(char root)
{
    char left = nodes[root - 'A'].front().first;
    char right = nodes[root - 'A'].front().second;
 
    if (left != '.')
        inOrder(left);
    cout << root ;
    if (right != '.')
        inOrder(right);
}
void postOrder(char root)
{
    char left = nodes[root - 'A'].front().first;
    char right = nodes[root - 'A'].front().second;
 
    if (left != '.')
        postOrder(left);
    if (right != '.')
        postOrder(right);
    cout << root ;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    int n;
    cin >> n;
 
    char data, left, right;
 
    for (int i = 0; i < n; i++)
    {
        cin >> data >> left >> right;
        nodes[data - 'A'].push_back(pp(left, right)); //부모 노드에 자식들을 이어준다.
    }
 
    preOrder('A');
    cout << '\n';
    inOrder('A');
    cout << '\n';
    postOrder('A');
    cout << '\n';
    return 0;
}