#include "BiTree.h"
#include <iostream>
using namespace std;
int main()
{
cout << "请输入二叉树的前序遍历序列（#表示空节点）：" << endl;
BiTree<char>T; //定义对象变量T
cout << "前序遍历：";
T.PreOrder();
cout << "\n中序遍历：";
T.InOrder();
cout << "\n后序遍历：";
T.PostOrder();
cout << "\n层序遍历：";
T.LevelOrder();
cout << "\n二叉树的深度：";
cout<<T.GetDepth();
cout << "\n【交换二叉树所有结点的左右子树】";
T.SwapSubTrees();
cout << "\n层序遍历：";
T.LevelOrder();
cout << "\n二叉树叶子结点总数：";
cout<<T.CountLeaves();
cout << "\n前序次序打印二叉树的叶子结点：";
T.PrintLeafNodesInPreOrder();
cout << "\n二叉树的最大宽度：";
cout << T.GetMaxWidth();
cout << "\n非递归的方式先序遍历：";
T.PreOrderTraversal();
cout << "\n【释放空间】";
T.~BiTree();
return 0;
}
