Basic interface for Red-Black tree data structure container in C++

rb_tree.cpp

#include <memory>

template <class Type, class Allocator = std::allocator<Type> >
class RB_Tree
{
public:
	RB_Tree (void) {}
	~RB_Tree () {}

	typedef Allocator allocator_type;

	void assign (void) {}

	void at (void) {}

	void back (void) {}

	void begin (void) {}

	void capacity (void) {}

	void clear (void) {}

	void empty (void) {}

	void end (void) {}

	void erase (void) {}

	void front (void) {}

	void get_allocator (void) {}

	void insert (void) {}

	void max_size (void) {}

	void pop_back (void) {}

	void push_back (void) {}

	void rbegin (void) {}

	void remove (void) {}

	void rend (void) {}

	void size (void) {}

	void operator [] (int pos) {}

	void operator << (void) {}

	void operator >> (void) {}

	void operator / (void) {}

	void operator % (void) {}

	void operator || (void) {}

	void operator + (void) {}

	void operator - (void) {}
};