class TestRBT {
    public static void main(String[] args) {
        RBTree t = new RBT();

	t.insert(5);
	t.insert(2);
	t.insert(7);
	t.insert(1);
	t.insert(12);

	if (t.isRedBlack()) {
	    System.out.println("Cool, it seems red-black.");	    
	} else {
	    System.out.println("Whoops, something's wrong!");	    
	}

	System.out.println(t.search(7));
	System.out.println(t.search(8));

	int i;
	int[] out = t.inorderTraversal();
	for (i=0; i<out.length; i++) {
	    System.out.println(out[i]);
	}

    }
}