#include<iostream.h>
#include<LINK/basic/RedBlackTree.h>

main()
{
	RedBlackTree<int, char> rbtree;
	ContainerNode *cn;

	rbtree.insert(1, 'b');
	rbtree.insert(-1, 'a');
	rbtree.insert(2, 'c');

	cout << rbtree << endl;

	rbtree.preorderWalk(cout);
	rbtree.inorderWalk(cout);
	rbtree.postorderWalk(cout);
}