btree_main.c

这是我在英国的C语言导师自己所写的一个二叉树的程序。

/* btree_main - investigating binary trees

		Author : M. Boyd, based on work by Kelly & Pohl
		Date   : 25-MAY-2004
		File   : btree_main.c

		Comments:

*/

#include "tree.h"
void pause (char *);
/* ------------------------------------------------------------------- */

int main (void)
{
   DATA array[] = {"\0HDKBFJLACEGI"};
   BTREE t;
   int choice;
   int i = 1;             /* array[0] is empty */

   printf ("\nBINARY TREES\t\t\tMichael Boyd, 2004.\n");

	/* Create binary tree from array */
   t = create_tree ( array, i, sizeof(array));

   printf ("\nBinary tree created from %s\n", &array[1] );

   /* Now traverse the tree in a user-specified order */
   printf ("\nChoose from the following traversal methods:-");
   printf ("\n1. In-order");
   printf ("\n2. Pre-order");
   printf ("\n3. Post-order");
   printf ("\n\n? => ");

   scanf ("%d", &choice);
   switch (choice)
   {
		case 1: 
			inorder (t);
			break;

		case 2: 
			preorder (t);
			break;

		case 3: 
			postorder (t);
			break;

		default:
			printf ("\nInvalid choice");
   }

   pause ("\nPress any key to exit ...");
   return EXIT_SUCCESS;
}

/* ------------------------------------------------------------------- */
void pause (char *s)
{
	printf ("%s", s);
	fflush (stdin);
    getchar ();
}