main.cpp

非常完美地二叉搜索树模板～～～～ 希望大家能够喜欢

#include "BinaryTree.h"

void main()
{
	int i=100;
	int j=0;
	int k=10;
	BinaryTree<int> T(0);
	T.InOrder();
	cout<<endl;
	T.InOrdering();
	cout<<endl;
	T.PreOrdering();
	cout<<endl;
	T.PreOrdering();
	cout<<endl;
	T.PostOrder();
	cout<<endl;
	T.PostOrdering();
	cout<<endl;
	T.PrintTree(T.Root(),0);
	cout<<endl;
	T.LevelScan();
	cout<<endl;
	cout<<T.CountNode(T.Root())<<endl;
	int count=0;
	T.CountLeaf(T.Root(),count);
	cout<<count<<endl;
	cout<<T.CountD1Node(T.Root())<<endl;
	cout<<T.CountD2Node(T.Root())<<endl;
	cout<<T.Depth(T.Root())<<endl;
	T.Min(T.Root(),i);
	cout<<i<<endl;
	T.Max(T.Root(),j);
	cout<<j<<endl;
	cout<<T.Equal(T.Root(),T.Root())<<endl;
	cout<<T.Search(k,T.Root())->Data()<<endl;
	T.Remove(k,T.Root());
	T.PrintTree(T.Root(),0);
	T.Exchange(T.Root());
	T.PrintTree(T.Root(),0);
	T.InOrdering();
}