1 #include "pch.h"
 2 #include <iostream>
 3 #include "BinaryTree.h"
 4 
 5 int main()
 6 {
 7     //场景测试2
 8     BinaryTree<int> btree;
 9     btree.PreCreateTree();//先序构建二叉树
10     cout << "先序遍历:";
11     btree.preOderTraversal(btree.root); cout << endl;//先序遍历    
12     cout << "中序遍历:";
13     btree.inOrderTraversal(btree.root); cout << endl;//中序遍历
14     cout << "后序遍历:";
15     btree.postOrderTraversal(btree.root); cout << endl;//后序遍历
16     cout << "逐层序遍历:";
17     btree.levelTraversal(btree.root);
18 
19 }