tree.cpp

创建一棵二叉树

// Tree.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include "GlobalDefining.h"
#include "TreeStruct.h"
#include "QueueStruct.h"
#include <iostream.h>

extern STATUS InitTree(BiTree &T);  //初始化二叉树
extern void DestroyTree(BiTree &T); //销毁二叉树
extern void Insert_SortTree (BiTree &T, int data);  //建立二叉排序树
extern void InOrderTraverse (BiTree &T);  //实现中序遍历
extern void LevelTraverse (BiTree &T);  //实现层次遍历
extern STATUS InitQueue (SqQueue &Q);  //构造一个空队列
extern STATUS EnQueue (SqQueue &Q, BiTree e);  //插入元素e为Q的新的队尾元素
extern STATUS DeQueue (SqQueue &Q, BiTree &e); //删除Q的队头元素，用e返回其值


int main(int argc, char* argv[])
{
	BiTree ST;
	InitTree(ST);

	//输入ST
	cout << "从键盘输入一批整数，以建立一棵二叉排序树ST，以输入-1为结束:" << endl;
	int x;
	cin >>x;
	while(x != -1)
	{
		Insert_SortTree (ST, x);
		cin >> x;
	}
	//输入结束，二叉排序树建立完毕

	//中序遍历并输出ST
	cout<<"中序遍历输出为:";
	InOrderTraverse (ST); 	
	cout<<endl;

	//层次遍历并输出ST
	cout<<"层次遍历输出为:";
	LevelTraverse (ST); 	
	cout<<endl;
	
    //销毁ST
	DestroyTree(ST);
	
	return 0;
}