알고리즘 Part 1

class Tree
{
public:
    int n;
    vector<int> *c; //array of dynamic array //2D array
 
    void init(const char *_fildName)
    {
        FILE *input = fopen(_fildName, "r"); // Read file
        fscanf(input, "%d", &n); // Get n from the file
        c = new vector<int>[n];
        for (int i = 0; i < n; i++)
        {
            int tmp;
            while (true)
            {
                fscanf(input, "%d", &tmp); // Get child data
                if (tmp == -1)
                    break;
                c[i].push_back(tmp);
            }
        }
        fclose(input);
    }
};

 

void DFS(Tree &t)
{ // &t : use as like local variable
    stack<int> s;
    s.push(0); // Root index;
    while (!s.empty())
    {
        int x = s.top();
        printf("%d ", x);
        s.pop();
        // Push all child node data
        for (int i = 0; i < t.c[x].size(); i++)
        {
            s.push(t.c[x][i]);
        }
    }
}

void BFS(Tree &t)
{
    queue<int> q;
    q.push(0);
 
    while (!q.empty())
    {
        int x = q.front();
        printf("%d ", x);
        q.pop();
        // Push all child node data
        for (int i = 0; i < t.c[x].size(); i++)
        {
            q.push(t.c[x][i]);
        }
    }
}

 

int main(int argc, char **argv)
{
    Tree t;
    t.init(argv[1]);
    DFS(t);
    BFS(t);
    return 1;
}

FILE.txt

19
1 2 3 -1
4 5 6 -1
7 8 -1
9 10 -1
11 12 -1
-1
-1
-1
13 14 -1
-1
15 16 -1
-1
-1
-1
-1
17 18 -1
-1
-1
-1