main.c

二叉数插入排序,及删除算法

#include "head.h"
void main(int argc,int *argv[])
{
	int flag = 1;
	int num;
	int i;
	int array[8] = {18,10,3,8,12,2,7,3};
	JD *tree = NULL;
	int data;
	do
	{
		menu();
		printf("请输入功能号:");
		scanf("%d",&num);
		printf("\n");
		switch(num)
		{
		case 0:
			{
				flag = 0;
				break;
			}
		case 1:
			{
				for(i = 0;i < 8;i++)
				{
					tree = insert_order(tree,array[i]);
				}
				break;
			}
		case 2:
			{
				if(tree == NULL)
				{
					printf("二叉树为空\n");
				}
				else
				{
					inorder(tree);
				}
				break;
			}
		case 3:
			{
				printf("请输入要删除节点值:");
				scanf("%d",&data);
				printf("\n");
				tree = dele(tree,data);
				break;
			}
		default:
			{
				printf("输入有误，请重新输入\n");
			}
		}
	}while(flag == 1);
}