int
main(int argc, char **argv) {
++argv, --argc;
init_globals();
if(argc <= 0) {
yyin = stdin;
proc_file();
}
else {
for( ; argc > 0; ++argv, --argc ) {
if( (yyin = fopen( argv[0], "r")) == NULL) {
perror(argv[0]);
continue;
}
proc_file();
fclose(yyin);
}
}
display_report(1);
display_report(2);
bistree_destroy(&tree);
return(0);
};
int main(int argc, char **argv) {
BiTree tree;
char *target;
char sarray[12][STRSIZ],
tarray[12][STRSIZ];
/*****************************************************************************
* *
* Load an array with the data to search. *
* *
*****************************************************************************/
strcpy(sarray[hop], "hop");
strcpy(sarray[hat], "hat");
strcpy(sarray[tap], "tap");
strcpy(sarray[bat], "bat");
strcpy(sarray[tip], "tip");
strcpy(sarray[mop], "mop");
strcpy(sarray[mom], "mom");
strcpy(sarray[cat], "cat");
strcpy(sarray[zoo], "zoo");
strcpy(sarray[wax], "wax");
strcpy(sarray[top], "top");
strcpy(sarray[dip], "dip");
/*****************************************************************************
* *
* Initialize the binary search tree. *
* *
*****************************************************************************/
bistree_init(&tree, compare_str, NULL);
/*****************************************************************************
* *
* Perform some binary search tree operations. *
* *
*****************************************************************************/
fprintf(stdout, "Inserting some nodes\n");
if (bistree_insert(&tree, sarray[tap]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
if (bistree_insert(&tree, sarray[tip]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
if (bistree_insert(&tree, sarray[top]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
if (bistree_insert(&tree, sarray[cat]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
if (bistree_insert(&tree, sarray[bat]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
fprintf(stdout, "Removing %s\n", sarray[tap]);
if (bistree_remove(&tree, &sarray[tap]) != 0) {
fprintf(stdout, "Could not find %s\n", sarray[tap]);
}
else {
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
}
fprintf(stdout, "Removing %s\n", sarray[top]);
if (bistree_remove(&tree, &sarray[top]) != 0) {
fprintf(stdout, "Could not find %s\n", sarray[top]);
}
else {
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
}
fprintf(stdout, "Removing %s\n", sarray[tip]);
if (bistree_remove(&tree, &sarray[tip]) != 0) {
fprintf(stdout, "Could not find %s\n", sarray[tip]);
}
else {
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
}
fprintf(stdout, "Removing %s\n", sarray[hop]);
if (bistree_remove(&tree, &sarray[hop]) != 0) {
fprintf(stdout, "Could not find %s\n", sarray[hop]);
}
else {
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
}
fprintf(stdout, "Inserting %s\n", sarray[hop]);
if (bistree_insert(&tree, sarray[hop]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
fprintf(stdout, "Inserting %s\n", sarray[dip]);
if (bistree_insert(&tree, sarray[dip]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
fprintf(stdout, "Inserting %s\n", sarray[tap]);
if (bistree_insert(&tree, sarray[tap]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
fprintf(stdout, "Inserting %s\n", sarray[top]);
if (bistree_insert(&tree, sarray[top]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
fprintf(stdout, "Inserting %s\n", sarray[tip]);
if (bistree_insert(&tree, sarray[tip]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
fprintf(stdout, "Inserting more nodes\n");
if (bistree_insert(&tree, sarray[mom]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
if (bistree_insert(&tree, sarray[hat]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
if (bistree_insert(&tree, sarray[mop]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
if (bistree_insert(&tree, sarray[wax]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
if (bistree_insert(&tree, sarray[zoo]) != 0)
return 1;
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
fprintf(stdout, "Removing %s\n", sarray[wax]);
if (bistree_remove(&tree, &sarray[wax]) != 0) {
fprintf(stdout, "Could not find %s\n", sarray[wax]);
}
else {
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
}
fprintf(stdout, "Removing %s\n", sarray[hop]);
if (bistree_remove(&tree, &sarray[hop]) != 0) {
fprintf(stdout, "Could not find %s\n", sarray[hop]);
}
else {
fprintf(stdout, "Tree size is %d\n", bistree_size(&tree));
fprintf(stdout, "(Preorder traversal)\n");
preorder_tree(bitree_root(&tree));
}
fprintf(stdout, "Looking up some nodes\n");
strcpy(tarray[0], "top");
strcpy(tarray[1], "hop");
strcpy(tarray[2], "wax");
strcpy(tarray[3], "hat");
strcpy(tarray[4], "xxx");
target = tarray[0];
if (bistree_lookup(&tree, (void **)&target) == -1)
fprintf(stdout, "Could not find %s\n", target);
else
fprintf(stdout, "Found %s\n", target);
target = tarray[1];
if (bistree_lookup(&tree, (void **)&target) == -1)
fprintf(stdout, "Could not find %s\n", target);
else
fprintf(stdout, "Found %s\n", target);
target = tarray[2];
if (bistree_lookup(&tree, (void **)&target) == -1)
fprintf(stdout, "Could not find %s\n", target);
else
fprintf(stdout, "Found %s\n", target);
target = tarray[3];
if (bistree_lookup(&tree, (void **)&target) == -1)
fprintf(stdout, "Could not find %s\n", target);
else
fprintf(stdout, "Found %s\n", target);
target = tarray[4];
if (bistree_lookup(&tree, (void **)&target) == -1)
fprintf(stdout, "Could not find %s\n", target);
else
fprintf(stdout, "Found %s\n", target);
/*****************************************************************************
* *
* Destroy the binary search tree. *
* *
*****************************************************************************/
fprintf(stdout, "Destroying the search tree\n");
bistree_destroy(&tree);
return 0;
}