-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST_Insertion_Traversal.cpp
97 lines (83 loc) · 1.56 KB
/
BST_Insertion_Traversal.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
#include<iostream>
using namespace std;
class node
{
public:
node *left;
int data;
node *right;
};
node *root=NULL;
node* insert(node* root, int val)
{
if(root==NULL)
{
node*p = new node;
p->data = val;
p->left = NULL;
p->right = NULL;
return p;
}
else if(val<root->data)
{
root->left = insert(root->left, val);
}
else
{
root->right= insert(root->right, val);
}
return root;
}
void preorder(node* root)
{
if (root != NULL)
{
cout<<root->data<<" ";
preorder(root->left);
preorder(root->right);
}
}
void inorder(node* root)
{
if (root != NULL)
{
inorder(root->left);
cout<<root->data<<" ";
inorder(root->right);
}
}
void postorder(node* root)
{
if (root != NULL)
{
postorder(root->left);
postorder(root->right);
cout<<root->data<<" ";
}
}
int main()
{
int choice,val;
node *p;
cout<<"Binary Search Tree Insertion and Traversal\n";
cout<<"\n1.Insertion \n2.Preorder\n3.Inorder\n4.Postorder\n";
while(1)
{
cout<<"\nEnter the choice: ";
cin>>choice;
switch(choice)
{
case 1: cout<<"Enter the value to be inserted: ";
cin>>val;
root=insert(root,val);
break;
case 2: preorder(root);
break;
case 3: inorder(root);
break;
case 4:postorder(root);
break;
}
}
return 0;
}