main.c

来自「数据结构课程设计报告,虽然好多地方都有」· C语言 代码 · 共 58 行

#include <stdio.h>
#include <stdlib.h>
#include "operate_tree.h"

main()
{
	int scan_switch;
	Tree *tree_one;
	tree_one=(Tree *)malloc(sizeof(Tree));
	while(1)
	{
		printf("1.按先序输入元素\n");
		printf("2.按先序输出元素\n");
		printf("3.按中序输出元素\n");
		printf("4.按后序输出元素\n");
		printf("5.叶子节点个数\n");
		printf("6.节点个数\n");
		printf("选择操作码:");
		scanf("%d",&scan_switch);
		switch(scan_switch)
		{
			case 1:
				Create_Tree(&tree_one);break;
			case 2:
				{
					PerOut_Tree(tree_one);
					printf("\n");
				}break;
			case 3:
				{
					InOut_Tree(tree_one);
					printf("\n");
				}break;
			case 4:
				{
					PostOut_Tree(tree_one);
					printf("\n");
				}break;
			case 5:
				{
					count_leaf=0;
					Find_Leaf(tree_one);
					printf("叶子节点个数为[%d]\n",count_leaf);
					
				}break;
			case 6:
				{
					count_pitch=0;
					Find_Pitch(tree_one);
					printf("节点个数为[%d]\n",count_pitch);
					
				}break;
	
		}
	}
}