Anonymous

#include <iostream>
#include <cstdlib>
#include "BinarySearchTree.h"
using namespace std;

int main()
{
	BinarySearchTree *bst;

	for(int i = 0; i<10; i++)
	{
		bst->insert(i,bst,0); //bst is node to start from, 0 is starting depth
	}

	bst->balance(bst);

	return 0;
}