-
Notifications
You must be signed in to change notification settings - Fork 0
/
Vertical Order.cpp
70 lines (65 loc) · 1.04 KB
/
Vertical Order.cpp
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
#include<bits/stdc++.h>
#include<map>
#include<vector>
using namespace std ;
class node{
public:
int data ;
node* left ;
node* right ;
node(int d){
data = d;
left = NULL ;
right = NULL ;
}
} ;
node *solve()
{
int d;
cin>>d;
queue<node *>q;
node *root=new node(d);
q.push(root);
int c1,c2;
while(!q.empty())
{
node *f=q.front();
q.pop();
cin>>c1>>c2;
if(c1!=-1)
{
f->left=new node(c1);
q.push(f->left);
}
if(c2!=-1)
{
f->right=new node(c2);
q.push(f->right);
}
}
return root;
}
void order(node* root, int p, map<int, vector<int>> &m){
if(root == NULL)
return ;
m[p].push_back(root->data) ;
order(root->left,p-1,m) ;
order(root->right,p+1,m) ;
return ;
}
int main()
{
int n;
cin>>n;
node* root = solve() ;
int p = 0 ;
map<int,vector<int>> m ;
order(root,p,m) ;
for(auto s:m){
//cout << s.first << " " ;
for(int l:s.second){
cout << l << " " ;
}
}
return 0;
}