treemain.c

ADT BinaryTree 的实现及验证程序采用的主要数据结构：二叉树、栈、队算法思想：1、 先序建树、输出树、后序遍历用递归方法。性能分析：O( n )2、 先序遍历、中序遍历：性能分析：O( n

#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include "E:\temp\zc\tree.c"
main()
{
	BiTree T;
	int cx,cy;
	char key;
	textbackground(BLACK);
	clrscr();
	printf("Now create the tree:\r\n");
	textcolor(YELLOW);
	CreateBiTree(&T);
	clrscr();
	textbackground(0);
	textcolor(15);
	cprintf("The tree is:\r\n");
	textcolor(YELLOW);
	PrintTree(T, 1);

	cx = wherex();
	cy = wherey();
	
	while(1)
	{
		window(1,cy+3,80,cy+13);
		textbackground(0);
		textcolor(15);
		clrscr();
		printf("Traverse:\n1-PreOrder 2-InOrder 3-PostOrder 4-LevelOrder\nThread:\n5-PreOrder 6-InOrder\n0 to exit\nYour choose:");
		key = getch();
		if(key>=(int)'0' && key<=(int)'6')
		{
			window(1,cy+14,80,cy+23);
			clrscr();
			switch(key)
			{
				case '1':{printf("Pre Order Traverse\n"); textcolor(GREEN);PreOrderTraverse(T, PrintElement); break;}
				case '2':{printf("In Order Traverse\n"); textcolor(GREEN);InOrderTraverse(T, PrintElement);break;}
				case '3':{printf("Post Order Traverse\n"); textcolor(GREEN);PostOrderTraverse(T, PrintElement);break;}
				case '4':{printf("Level Order Traverse\n"); textcolor(GREEN);LevelOrderTraverse(T, PrintElement);break;}
				case '5':{printf("Pre Order Threading\n");PreOrderThreading(T);printf("complete\n");break;}
				case '6':{printf("In Order Threading\n");InOrderThreading(T);printf("complete\n");break;}
				case '0':exit(0);
				default:printf("What do you want?");
			}
		}
	}
}