-
Notifications
You must be signed in to change notification settings - Fork 0
/
InorderusingStack.cpp
116 lines (110 loc) · 1.88 KB
/
InorderusingStack.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
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
/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <ext/numeric>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/algorithm>
using namespace std;
using namespace __gnu_cxx;
#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define ii pair<int,int>
#define vs vector<string>
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)
struct node
{
node *left, *right;
int data;
};
void inorder(node *root)
{
stack<node *>S;
node *current=root;
bool done = false;
while(!done)
{
if(current!=NULL)
{
S.push(current);
current=current->left;
} else
{
if(!S.empty())
{
current=S.top();
cout<<current->data<<" ";
S.pop();
current=current->right;
} else
{
done = true;
}
}
}
}
node *newnode(int d)
{
node *root=(node *)malloc(sizeof(node*));
root->left=NULL;
root->right=NULL;
root->data=d;
return root;
}
void treeinsert(node **root, int n)
{
node *temp=*root;
if(temp==NULL)
{
*root=newnode(n);
} else
{
if(n>=(*root)->data)
treeinsert(&((*root)->right), n);
else
treeinsert(&((*root)->left), n);
}
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
node *root=NULL;
treeinsert(&root, 4);
treeinsert(&root, 3);
treeinsert(&root, 1);
treeinsert(&root, 5);
inorder(root);
system("pause");
}