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

main()
{
	BinarySearchTree<int, char> bntree;
	ContainerNode *cn;

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

	cout << bntree << endl;

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