#include <iostream>
#include <ctime>

#include "Splay_tree.h"
using namespace Data_structures;

int main() {
	int const N = 7;
	int const M = 5;

	Splay_tree<int> splay;

	for ( int i = 0; i < N; ++i ) {
		splay.insert( (i * M) % N );
		std::cout << splay << std::endl;
	}

	for ( int i = 0; i < N; ++i ) {
		splay.member( i );
		std::cout << splay << std::endl;
	}

	for ( int i = 0; i < N; ++i ) {
		splay.member( i );
		std::cout << splay << std::endl;
	}

	splay.front();
	std::cout << splay << std::endl;

	splay.back();
	std::cout << splay << std::endl;

	splay.front();
	std::cout << splay << std::endl;

	splay.back();
	std::cout << splay << std::endl;

	for ( int i = 0; i < N; ++i ) {
		splay.erase( i );
		std::cout << splay << std::endl;
	}

	return 0;
}