-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest.c
130 lines (128 loc) · 2.25 KB
/
test.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
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
#include<stdio.h>
#include<stdlib.h>
struct Record
{
int info;
struct Record *left;
struct Record *right;
};
struct Stack
{
struct Record *sroot;
struct Stack *nextAdd;
};
struct Record *root=NULL;
struct Stack *stack=NULL;
void addNode(int);
void inOrderTraversal(void);
main()
{
int number;
while(1)
{
printf("\n\tEnter no : ");
scanf("%d",&number);
if(number==-1)
{
break;
}
addNode(number);
}
printf("\n\t***********************\n\t");
inOrderTraversal();
}
void addNode(int tmp)
{
struct Record *node,*pointer=root;
node = (struct Record*)malloc(sizeof(struct Record));
if(pointer==NULL)
{
root=node;
node->info=tmp;
node->right=NULL;
node->left=NULL;
return;
}
while(1)
{
if(pointer->info>tmp)
{
if(pointer->left!=NULL)
{
pointer = pointer->left;
}
else
{
pointer->left = node;
node->info=tmp;
node->right=NULL;
node->left=NULL;
return;
}
}
else if(pointer->info<tmp)
{
if(pointer->right!=NULL)
{
pointer = pointer->right;
}
else
{
pointer->right = node;
node->info=tmp;
node->right=NULL;
node->left=NULL;
return;
}
}
}
}
void inOrderTraversal()
{
struct Record *pointer=root;
struct Stack *node,*fnode;
printf("\n\n");
while(pointer!=NULL)
{
if(pointer->left!=NULL)
{
node=(struct Stack*)malloc(sizeof(struct Stack));
node->sroot=pointer;
node->nextAdd = stack==NULL?NULL:stack;
stack=node;
pointer=pointer->left;
}
else if(pointer->right==NULL)
{
printf(" %d",pointer->info);
if(stack==NULL)return;
else
{
while((stack->sroot)->right==NULL)
{
printf(" %d",(stack->sroot)->info);
if(stack->nextAdd==NULL)
{
return;
}
else
{
fnode=stack->nextAdd;
free(stack);
stack=fnode;
}
}
printf(" %d",(stack->sroot)->info);
pointer=(stack->sroot)->right;
fnode=stack->nextAdd;
free(stack);
stack=fnode;
}
}
else
{
printf(" %d",pointer->info);
pointer = pointer->right;
}
}
}