#include "StdAfx.h"

#include "tree.h"

void logo(){	
		printf("                 Implement of data struct,by aid  from jk0212.\n");
		printf("Can be shared or changed,no rights.But hope you do your homework by yourself\n");
};


void treeProblem(){
	int s;
	while(true){
		system("cls");		
		logo();
		printf("請(qǐng)選擇想要演示的內(nèi)容\n");
		
		printf("1.按先序擴(kuò)展序列建立二叉樹(shù)\n");
		printf("2.遍歷的遞歸算法\n");
		printf("3.遍歷的非遞歸算法\n");
		printf("4.求二叉樹(shù)的深度(后序遍歷)\n");
		printf("5.用普里姆(Prim)算法構(gòu)造最小生成樹(shù)\n");
		printf("0.退出\n");

		scanf("%d",&s);
		getchar();
		switch(s){
		case 1:CreateBitTreeInFirst();break;
		case 2:VisitBitTreeInRecursion();break;
		case 3:VisitBitTreeInUnrecursion();break;
		case 4:BitTreeDepth();break;
		case 5:Prim();break;
		case 0:return;
		default:break;
		}
	}

};

void sortProblem(){
	int s;
	while(true){
		system("cls");		
		logo();
		printf("請(qǐng)選擇想要演示的內(nèi)容\n");
		
		printf("1.簡(jiǎn)單選擇排序\n");
		printf("2.快速排序\n");
		printf("3.折半插入排序\n");
		printf("4.冒泡排序\n");
		printf("0.退出\n");

		scanf("%d",&s);
		switch(s){
		case 1:break;
		case 2:break;
		case 3:break;
		case 4:break;
		case 0:return;
		default:break;
		}
	}
};


void QueenProblem(){
	int s;
	system("cls");		
	logo();
	printf("請(qǐng)輸入皇后問(wèn)題的規(guī)模，即棋盤的大小:");	
	scanf("%d",&s);
	getchar();
	queen(s);

};
void findProblem(){
};
void OtherProblem(){
};