#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include "binarySearchTree.h"
#include "avl.h"
using namespace std;

int main()
{
	binarySearchTree X;
	avl T;

	for (int i = 0; i < 50; i++)
	{
		int x = rand();
		X.insert(x);
		T.insert(x);
	}

	for (int i = 0; i < 1000; i++)
	{
		X.insert(i);
		T.insert(i);
	}

	T.display();
	cout << "binary Search tree height: " << X.height() << endl;
	cout << "AVL Tree height: " << T.height() << endl;

	return 0;
}