-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path182.cpp
56 lines (48 loc) · 1.1 KB
/
182.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
#include<bits/stdc++.h>
using namespace std;
class Node{
public:
int data;
Node *left,*right;
Node(int x){
data=x;
left=right=NULL;
}
};
void preorderRecursion(Node *root){
if(root){
cout<<root->data<<" ";
preorderRecursion(root->left);
preorderRecursion(root->right);
}
}
void preorderIteration(Node *root){
Node *curr=root;
stack<Node *> s;
vector<int> res;
if(!root) return;
s.push(curr);
while(!s.empty()){
Node *x=s.top();
s.pop();
res.push_back(x->data);
if(x->right) s.push(x->right);
if(x->left) s.push(x->left);
}
for(int i=0;i<res.size();i++) cout<<res[i]<<" ";
}
int main(){
Node *root=new Node(8);
root->left=new Node(3);
root->right=new Node(10);
root->left->left=new Node(1);
root->left->right=new Node(6);
root->left->right->left=new Node(4);
root->left->right->right=new Node(7);
root->right->right=new Node(14);
root->right->right->left=new Node(13);
preorderRecursion(root);
cout<<"\n";
preorderIteration(root);
return 0;
}