OpenSourceForAll/basicsoftrees.cpp at master · DSC-BVP/OpenSourceForAll · 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
114
115
116
#include<iostream>
#include<vector>
#include<queue>
using namespace std;

class treenode
{
public:
    int data;
    vector<treenode*> children;
    treenode(int data)
    {
        this->data=data;
    }
};

treenode*takeinputlw()
{
    int data;
    cin>>data;
    treenode*root=new treenode(data);
    queue<treenode*> q;
    q.push(root);

    while(q.size()!=0)
    {
        treenode*frontnode=q.front();
        q.pop();
        int num;
        cin>>num;

        for(int i=0;i<num;i++)
        {
            int cdata;
            cin>>cdata;
            treenode* child=new treenode(cdata);
            frontnode->children.push_back(child);
            q.push(child);
        }
    }
    return root;
}


treenode*takeinput()
{
    int data,num;
    cin>>data;
    cin>>num;

    treenode*root=new treenode(data);

    for(int i=0;i<num;i++)
    {
        treenode*cnode=takeinput();
        root->children.push_back(cnode);
    }

    return root;
}

void printa1(treenode*root)
{
     cout<<root->data<<": ";
    for(int i=0;i<root->children.size();i++)
    {
        cout<<root->children[i]->data<<" ";
    }
    cout<<endl;

     for(int i=0;i<root->children.size();i++)
    {
      printa1(root->children[i]);
    }


}


void printa2(treenode*root)
{

     for(int i=0;i<root->children.size();i++)
    {
      printa2(root->children[i]);
    }

     cout<<root->data<<": ";
    for(int i=0;i<root->children.size();i++)
    {
        cout<<root->children[i]->data<<" ";
    }
    cout<<endl;
}

int main()
{
   /* treenode*root=new treenode(10);
    treenode*node1=new treenode(1);
    treenode*node2=new treenode(2);

    root->children.push_back(node1);
    root->children.push_back(node2); */

    treenode*root=takeinputlw();


    printa1(root);

    cout<<endl;

    printa2(root);

    return 0;
}