[알고스팟] 쿼드 트리 뒤집기 QUADTREE

https://algospot.com/judge/problem/read/QUADTREE

algospot.com :: QUADTREE

 

#include <iostream>
#include <string>
 
using namespace std;
 
class Node
{
public:
    Node* parent;
 
    Node* firstChild;
    Node* secondChild;
    Node* thirdChild;
    Node* fourthChild;
 
    char data;
 
    Node(char ch)
    {
        data = ch;
 
        parent = NULL;
        firstChild = NULL;
        secondChild = NULL;
        thirdChild = NULL;
        fourthChild = NULL;
    }
 
};
 
Node* makeTree(string::iterator& it)
{
    char ch = *it;
    Node* n = new Node(ch);
 
    if (ch == 'x')
    {
        it++;
        n->firstChild = makeTree(it);
        it++;
        n->secondChild = makeTree(it);
        it++;
        n->thirdChild = makeTree(it);
        it++;
        n->fourthChild = makeTree(it);
 
    }
 
    return n;
}
 
void solve(Node* n)
{
    cout << n->data;
 
    if (n->firstChild != NULL)
    {
        Node* temp1 = n->firstChild;
        n->firstChild = n->thirdChild;
        n->thirdChild = temp1;
 
        Node* temp2 = n->secondChild;
        n->secondChild = n->fourthChild;
        n->fourthChild = temp2;
 
        solve(n->firstChild);
        solve(n->secondChild);
        solve(n->thirdChild);
        solve(n->fourthChild);
    }
}
 
int main()
{
    int count;
    cin >> count;
    while (count--)
    {
        string str;
        cin >> str;
 
        string::iterator it = str.begin();
        Node* start = makeTree(it);
        solve(start);
        cout << endl;
    }
 
    return 0;
}