// test binary search tree
//
#include <iostream>
#include "Tree.h"
using namespace std;

int main()
{
  Tree t;

  long x[] = { 13, 25, 20, 10, 12, 2, 31, 29, -1 };

  for( int i = 0; x[i] > 0; ++i) t.insert(x[i]);

  t.print();
}