test.cpp

来自「1) 以二叉链表为存储结构」· C++ 代码 · 共 75 行

#include"BinaryTree.h"
#include<iostream.h>
#include<cstring>
int main()
{
	BinaryTree a;
	cout<<"建立二叉树，请输入二叉树的元素:"<<endl;
	a.create();
	char str[10];
	cout<<"前序遍历二叉树请输入:pre"<<endl;	
	cout<<"中序遍历二叉树请输入:in"<<endl;
	cout<<"后序遍历二叉树请输入:post"<<endl;
	cout<<"求树高度请输入:     height"<<endl;	
    cout<<"叶子数目请输入:     leaf"<<endl;
	cout<<"节点数目请输入:     size"<<endl;
	cout<<"终止操作请输入：    quit"<<endl;
	while(1)
	{
		cin>>str;
		if(strcmp(str,"pre")==0)
		{	
			cout<<"前序遍历二叉树:"<<endl;
			a.preorder();
			cout<<"请继续输入操作："<<endl;
		}
		if(strcmp(str,"in")==0)
		{
		
			cout<<"中序遍历二叉树:"<<endl;
			a.inorder();
			cout<<"请继续输入操作："<<endl;
		}
		if(strcmp(str,"post")==0)
		{
			cout<<"后序遍历二叉树:"<<endl;
			a.postorder();	
			cout<<"请继续输入操作："<<endl;
	
	
		}
		if(strcmp(str,"height")==0)
		{
			cout<<"求树高度:"<<endl;
			int b=a.height();
			cout<<b<<endl;
			cout<<"请继续输入操作："<<endl;
	
		}
		if(strcmp(str,"leaf")==0)
		{
	
			cout<<"叶子数目:"<<endl;
			int b;
			b=a.leaf();
			cout<<b<<endl;
			cout<<"请继续输入操作："<<endl;
		}
		if(strcmp(str,"size")==0)
		{
			cout<<"节点数目:"<<endl;
			int b;
			b=a.size();
			cout<<b<<endl;	
			cout<<"请继续输入操作："<<endl;
		}
		if(strcmp(str,"quit")==0)
		{
	
			break;
		
		}

	}
	return 0;
}