#include <iostream>
#include "B23_tree.h"
using namespace Data_structures;
using namespace std;

int main() {
	B23_tree<int> tree;

	for ( int i = 1; i <= 30; ++i ) {
		cout << "----------------------" << endl;
		int n = (53241*i) % 37;
		tree.insert( n );
		cout << "Inserted " << n << "..." << endl;
		cout << "[" << tree.front() << ", " << tree.back() << "]" << endl;
		tree.print();
	}

	for ( B23_tree<int>::iterator itr = tree.begin(); itr != tree.end(); ++itr ) {
		cout << *itr << " ";
	}

	cout << endl;

	return 0;
}