-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.c
85 lines (72 loc) · 1.48 KB
/
main.c
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
#include <stdio.h>
#include <stdlib.h>
typedef struct Bst Node;
struct Bst{
int data;
Node *left, *right;
};
void insert(Node **root, int val);
int search(Node *root, int val);
void preOrder(Node *root);
int main()
{
Node *root = NULL;
insert(&root, 8);
insert(&root, 4);
insert(&root, 15);
insert(&root, 6);
/* Searching */
int result = search(root, 4);
(result == 1) ? printf("SUCESS : NODE FOUND\n"):
printf("FAILED : NODE NOT FOUND\n");
printf("OUTPUT : \n");
preOrder(root);
}
void insert(Node **root, int val)
{
Node *tmp = NULL;
if(!(*root))
{
/* Creating a new node */
tmp = (Node *)malloc(sizeof(*tmp));
tmp->left = tmp->right = NULL;
tmp->data = val;
*root = tmp;
return;
}
if(val < (*root)->data)
insert(&(*root)->left, val);
else if(val > (*root)->data)
insert(&(*root)->right, val);
}
int search(Node *root, int val)
{
if(!(root))
exit(EXIT_FAILURE);
if(val == root->data)
return 1;
else if(val < root->data)
search(root->left, val);
else
search(root->right, val);
}
void deleteBST(Node *root)
{
if(root)
{
deleteBST(root->left);
deleteBST(root->right);
free(root);
}
return;
}
void preOrder(Node *root)
{
if(root)
{
printf("%d\n", root->data);
preOrder(root->left);
preOrder(root->right);
}
return;
}