#include <iostream>
#include "Binary_search_tree_recursive.h"

using namespace std;

int main() {
	int const N = 1000000;

	Binary_search_tree<double> tree;

	for ( int i = 0; i < N; ++i ) {
		tree.insert( drand48() );
	}

	cout << "Size =    " << tree.size() << endl;
	cout << "Height =  " << tree.height() << endl;

	for ( int i = 0; i < 100*N; ++i ) {
		if ( tree.find( drand48() ) ) {
			cout << "...found something..." << endl;
		}
	}

	tree.clear();

	cout << "Size =    " << tree.size() << endl;
	cout << "Height =  " << tree.height() << endl;

	return 0;
}