二叉树 C++实现 建树 前序 中序 后序 层序

// test binary tree class #include <iostream> using namespace std; #include "binary.h" // globals int count = 0; //BinaryTree<int> a,x,y,z; BinaryTree<int> a,b,c,d,e,f,g,h; template<class T> void ct(BinaryTreeNode<T> *t) {count++;} void main(void) { /*y.MakeTree(1,a,a); z.MakeTree(2,a,a); x.MakeTree(3,y,z); y.MakeTree(4,x,a);*/ a.MakeTree(5,f,f); b.MakeTree(7,f,f); c.MakeTree(6,f,f); d.MakeTree(3,f,a); e.MakeTree(4,b,c); g.MakeTree(2,d,e); h.MakeTree(1,g,f); cout << "Preorder sequence is "; h.PreOutput(); cout << "Inorder sequence is "; h.InOutput(); cout << "Postorder sequence is "; h.PostOutput(); cout << "Level order sequence is "; h.LevelOutput(); cout << "Number of nodes = "; cout << h.Size() << endl; cout << "Height = "; cout << h.Height() << endl; h.PreOrder(ct); cout << "Count of nodes is " << count << endl; }