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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
|
/*@@
@file BinaryTree.c
@date Mon Oct 5 11:00:01 1998
@author Tom Goodale
@desc
Routines to deal with binary trees
@enddesc
@version $Header$
@@*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "util_BinaryTree.h"
static char *rcsid = "$Header$";
/********************************************************************
******************** External Routines ************************
********************************************************************/
/*@@
@routine Util_BinTreeStoreData
@date Mon Oct 5 11:04:55 1998
@author Tom Goodale
@desc
Stores data in a binary tree.
@enddesc
@calls
@calledby
@history
@endhistory
@@*/
uBinTree *Util_BinTreeStoreData(uBinTree *root,
uBinTree *subtree,
void *data,
int (*compare)(const void *, const void *))
{
int order;
if(!subtree)
{
/* Create a new element. */
subtree = (uBinTree *)malloc(sizeof(uBinTree));
if(subtree)
{
subtree->left=NULL;
subtree->right=NULL;
subtree->data = data;
if(root)
{
if((order = compare(data, root->data)) < 0)
{
root->left = subtree;
}
else
{
root->right = subtree;
}
}
}
}
else
{
/* Go down left or right branch. */
if((order = compare(data, root->data)) < 0)
{
subtree = Util_BinTreeStoreData(subtree, subtree->left, data, compare);
}
else if(order > 0)
{
subtree = Util_BinTreeStoreData(subtree, subtree->right, data, compare);
}
else if(order==0)
{
/* Duplicate key. */
subtree = NULL;
}
}
/* Return either the new node, or NULL if either a duplicate value or
* memory failure.
*/
return subtree;
}
/*@@
@routine Util_BinTreeTraverseInorder
@date Mon Oct 5 11:05:54 1998
@author Tom Goodale
@desc
Traverse a tree 'inorder'
@enddesc
@calls
@calledby
@history
@endhistory
@@*/
int Util_BinTreeTraverseInorder(uBinTree *root,
int (*process)(void *, void *),
void *info)
{
int terminate;
terminate = 0;
if(root)
{
terminate = Util_BinTreeTraverseInorder(root->left, process, info);
if(!terminate) terminate = process(root->data,info);
if(!terminate) terminate = Util_BinTreeTraverseInorder(root->right, process, info);
}
return terminate;
}
/*@@
@routine Util_BinTreeTraversePreorder
@date Mon Oct 5 11:05:54 1998
@author Tom Goodale
@desc
Traverse a tree 'preorder'
@enddesc
@calls
@calledby
@history
@endhistory
@@*/
int Util_BinTreeTraversePreorder(uBinTree *root,
int (*process)(void *, void *),
void *info)
{
int terminate;
terminate = 0;
if(root)
{
terminate = process(root->data, info);
if(!terminate) terminate = Util_BinTreeTraversePreorder(root->left, process, info);
if(!terminate) terminate = Util_BinTreeTraversePreorder(root->right, process,info);
}
return terminate;
}
/*@@
@routine Util_BinTreeTraversePostorder
@date Mon Oct 5 11:05:54 1998
@author Tom Goodale
@desc
Traverse a tree 'postorder'
@enddesc
@calls
@calledby
@history
@endhistory
@@*/
int Util_BinTreeTraversePostorder(uBinTree *root,
int (*process)(void *, void *),
void *info)
{
int terminate;
terminate = 0;
if(root)
{
terminate = Util_BinTreeTraversePostorder(root->left, process, info);
if(!terminate) terminate = Util_BinTreeTraversePostorder(root->right, process, info);
if(!terminate) terminate = process(root->data, info);
}
return terminate;
}
/*@@
@routine Util_BinTreePrintNodes
@date Mon Oct 5 11:06:52 1998
@author Tom Goodale
@desc
Allows a binary tree to be printed out.
@enddesc
@calls
@calledby
@history
@endhistory
@@*/
int Util_BinTreePrintNodes(uBinTree *root,
int depth,
void (*print_node)(void *, int))
{
if(root)
{
Util_BinTreePrintNodes(root->left, depth+1,print_node);
print_node(root->data,depth);
Util_BinTreePrintNodes(root->right, depth+1, print_node);
}
return 0;
}
/*@@
@routine Util_BinTreeFindNode
@date Mon Oct 5 11:06:52 1998
@author Tom Goodale
@desc
Find a node.
@enddesc
@calls
@calledby
@history
@endhistory
@@*/
uBinTree *Util_BinTreeFindNode(uBinTree *root,
void *data,
int (*compare)(const void *, const void *))
{
int order;
uBinTree *node;
/* Go down left or right branch. */
if((order = compare(data, root->data)) < 0)
{
node = Util_BinTreeFindNode(root->left, data, compare);
}
else if(order > 0)
{
node = Util_BinTreeFindNode(root->right, data, compare);
}
else if(order==0)
{
/* Found it. */
node = root;
}
else
{
node = NULL;
}
return node;
}
/* Stuff to test the routines. */
/*#define TEST_BinaryTree*/
#ifdef TEST_BinaryTree
typedef struct
{
int i;
} t_infodata ;
int process(char *data, t_infodata *infodata)
{
printf("%d, %s\n", infodata->i, data);
infodata->i++;
return 0;
}
void print_node(char *data, int depth)
{
int i;
for(i=0; i < depth; i++) printf("*");
printf("%s\n", data);
}
int main(void)
{
uBinTree *root;
t_infodata infodata;
char instring[500];
char *newstring;
uBinTree *node;
infodata.i=0;
root = NULL;
while(scanf("%s", instring) && strcmp("quit", instring))
{
newstring = malloc(strlen(instring)*sizeof(char));
strcpy(newstring, instring);
if(!root)
{
root = Util_BinTreeStoreData(root, root, newstring, (int (*)(const void *, const void *))strcmp);
}
else
{
Util_BinTreeStoreData(root, root, newstring, (int (*)(const void *, const void *))strcmp);
}
}
Util_BinTreeTraverseInorder(root, (int (*)(void *, void *))process, (void *)&infodata);
Util_BinTreePrintNodes(root, 0, (void (*)(void *, int))print_node);
printf("String to find ? ");
scanf("%s", instring);
node = Util_BinTreeFindNode(root, instring, (int (*)(const void *, const void *))strcmp);
if(node)
{
printf("Found a node, node->data is %s\n", node->data);
}
else
{
printf("Unable to find node with %s\n", instring);
}
return 0;
}
#endif
|
