-
Notifications
You must be signed in to change notification settings - Fork 0
/
bst1.c
66 lines (58 loc) · 1.17 KB
/
bst1.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
#include<stdio.h>
#include<stdlib.h>
struct BSTNode
{
int data;
struct BSTNode *left,*right;
};
void insert(struct BSTNode *root,int data)
{
struct BSTNode *n=malloc(sizeof(struct BSTNode));
struct BSTNode *par;
n->left=NULL;
n->data=data;
n->right=NULL;
if(root==NULL)
root=n;
else
{
par=root;
while(par!=NULL)
{
if(par->data>data)
{
if(par->left==NULL)
par->left=n;
par=par->left;
}
else if(par->data<data)
{
if(par->right==NULL)
par->right=n;
par=par->right;
}
}
}
}
/*void perOrder(struct BSTNode *root)
{
if(root!=NULL)
{
printf("%d\n",root->data);
preOrder(root->left);
preOrder(root->right);
}
}*/
int main()
{
int data,i;
struct BSTNode *root=NULL;
for(i=0;i<4;i++)
{
printf("enter a data :");
scanf("%d",&data);
insert(root,data);
}
/*perOrder(root);*/
return 0;
}