/
inorder succ in BST.cpp
123 lines (101 loc) · 2.31 KB
/
inorder succ in BST.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
116
117
118
119
120
121
122
123
#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
int key;
struct node *left, *right;
}node;
node *insert_node(node *root, int data)
{
node *temp = (node *)malloc(sizeof(node));
temp->key = data;
temp->right = temp->left = NULL;
if(root == NULL)
return temp;
if(data < root->key)
root->left = insert_node(root->left, data);
else if(data > root->key)
root->right = insert_node(root->right, data);
return root;
}
void inorder(node *root)
{
if(root != NULL)
{
inorder(root->left);
printf("%d\t", root->key);
inorder(root->right);
}
}
node *deletenode(node *root, int data)
{
node *temp;
if(root == NULL)
return root;
if(data < root->key)
root->left = deletenode(root->left, data);
else if(data > root->key)
root->right = deletenode(root->right, data);
else
{
if(root->left == NULL)
{
temp = root->right;
free(root);
return temp;
}
else if(root->right == NULL)
{
temp = root->left;
free(root);
return temp;
}
else
{
temp = root->right;
while(temp->left != NULL)
temp = temp->left;
root->key = temp->key;
root->right = deletenode(root->right, temp->key);
return root;
}
}
}
void inorder_succ(node *root, int data, node * &succ)
{
int ans;
if(root == NULL)
return;
if(data == root->key)
{
if(root->right != NULL)
{
node *temp = root->right;
while(temp->left != NULL)
temp = temp->left;
succ = temp;
}
}
else if(data > root->key)
inorder_succ(root->right, data, succ);
else if(data < root->key)
inorder_succ(root->left, data, succ);
}
int main()
{
node *root=NULL, *temp, *succ;
int data, n, del, ans;
scanf("%d", &n);
for(int i=0; i<n; i++)
{
scanf("%d", &data);
root = insert_node(root, data);
}
inorder(root);
printf("\n");
printf("Whose inorder successor u want to know ??\n");
scanf("%d",&del);
inorder_succ(root, del, succ);
printf("%d\n", succ->key);
return 0;
}