// test binary tree class

#include "binary.h"

// globals
int count = 0;
BinaryTree<int> a,b,x,y,z;

template<class T>
void ct(BinaryTreeNode<T> *t) {count++;}

void main(void)
{
   y.MakeTree(1,a,a);
   b.MakeTree(2,a,a);
   cout<<y.Compare(b)<<endl;
   z.MakeTree(2,a,a);
   x.MakeTree(3,y,z);
   y.MakeTree(4,x,a);
   cout << "Preorder sequence is ";
   y.PreOutput();
   y.SwapChildren();
   y.PreOutput();
   cout << "Inorder sequence is ";
   y.InOutput();
   cout << "Postorder sequence is ";
   y.PostOutput();
   cout << "Level order sequence is ";
   y.LevelOutput();
   cout << "Number of nodes = ";
   cout << y.Size() << endl;
   cout << "Height = ";
   cout << y.Height() << endl;
   y.PreOrder(ct);
   cout << "Count of nodes is " << count << endl;
   b.PostCopy(y);
   b.PreOutput();
   int d;
   b.BreakTree(d,z,x);
   x.PreOutput();
   BinaryTree<int> q=y;
   q.PreOutput();
}