#include #include "Tree.h" void PrintElt(TreeElementType e) { printf("%s ", e); } /*L.Allison*/ main() { char str[100]; Tree T = NULL; printf("Binary Search Tree Demonstration, L.Allison, Monash University\n"); printf("Type some names separated by white space, end with ^D\n"); while( scanf(" %s", &str) != EOF) /* assumes elements are strings */ insertTree(str, &T); WriteTree(T); printf("prefix: "); prefix(T, PrintElt); printf("\n"); printf("infix: "); infix(T, PrintElt); printf("\n"); printf("postfix: "); postfix(T, PrintElt); printf("\n"); printf("breadth-1st:"); BreadthFirst(T, PrintElt); printf("\n"); }/*main*/ /* Simple Binary Search Tree Driver main() Program. */