forked from AllAlgorithms/cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbinary_search_tree.cpp
More file actions
142 lines (140 loc) · 2.69 KB
/
binary_search_tree.cpp
File metadata and controls
142 lines (140 loc) · 2.69 KB
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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include<iostream>
#include<stdlib.h>
#include<stack>
using namespace std;
struct tree
{
int value;
tree *left;
tree *right;
}*root=NULL;
void inserte()
{
int v,insert_left=0,insert_right=0;
cout<<"Enter Value To Insert: ";
cin>>v;
tree *newnode=(tree*)malloc(sizeof(tree));
newnode->value=v;
newnode->left=NULL;
newnode->right=NULL;
if(root==NULL)
root=newnode;
else
{
tree *temp=root;
while(1)
{
if(insert_left==1||insert_right==1)
break;
if(v<temp->value)
{
if(temp->left!=NULL)
temp=temp->left;
else
insert_left=1;
}
else
if(v>temp->value)
{
if(temp->right!=NULL)
temp=temp->right;
else
insert_right=1;
}
}
if(insert_left==1)
temp->left=newnode;
else
if(insert_right==1)
temp->right=newnode;
}
}
void preorder()
{
tree *temp=root;
stack <tree*>s;
repeat:
while(1)
{
if(temp->right!=NULL)
s.push(temp->right);
if(temp->left!=NULL)
{
cout<<temp->value<<" ";
temp=temp->left;
}
else
if(temp->left==NULL)
{
cout<<temp->value<<" ";
break;
}
}
while(!s.empty())
{
temp=s.top();
s.pop();
goto repeat;
}
}
void inorder()
{
tree *temp=root;
stack <tree*>s;
repeat:
while(1)
{
s.push(temp);
if(temp->left!=NULL)
temp=temp->left;
else
break;
}
while(1)
{
repeat1:
temp=s.top();
cout<<temp->value<<" ";
s.pop();
if(temp->right==NULL)
goto repeat1;
else
if(temp->right!=NULL)
{
temp=temp->right;
goto repeat;
}
else
if(s.empty())
break;
}
}
int main()
{
int ch;
while(1)
{
cout<<endl<<"1.Insert into tree"<<endl;
cout<<"2.Preorder"<<endl;
cout<<"3.Inorder"<<endl;
cout<<"Choice: ";
cin>>ch;
if(ch==1)
inserte();
else
if(ch==2)
{
preorder();
cout<<endl;
}
else
if(ch==3)
{
inorder();
cout<<endl;
}
else
return 0;
}
return 0;
}