class MyBinaryTree extends BinaryTree {

    public  boolean smallerThan(Object obj1, Object obj2) {
        return obj1.toString().compareTo(obj2.toString()) < 0;
    }

    public  boolean greaterThan(Object obj1, Object obj2) {
        return obj1.toString().compareTo(obj2.toString()) > 0;
    }

    public  boolean isEqual(Object obj1, Object obj2) {
	return obj1.toString().compareTo(obj2.toString()) == 0;
    }

}


public class BtMain {

    public static void main(String[] args) {

	MyBinaryTree bt = new MyBinaryTree();

        // in den Baum einfuegen:
	bt.insert("aaaa");
	bt.insert("bbbb");
	bt.insert("cccc");
	bt.insert("acccc");
	bt.insert("acdccc");
	bt.insert("dddd");
	bt.insert("xdddd");
	bt.insert("xddmdd");
	bt.insert("eelllee");

        // im Baum suchen:
	System.out.println("Search cccc returns " + bt.find("cccc"));
	System.out.println("Search gfggfg returns " + bt.find("gfggfg"));

        // Ausgabe des vollständigen Baums, geordnet 
        // nach smallerThan()-Relation:
	bt.printInOrder();

        // im Baum Loeschen:
	System.out.println("Deleting dddd results in");
        bt.delete("dddd");
	bt.printInOrder();
	System.out.println("Deleting bla results in");
        bt.delete("bla");
	bt.printInOrder();


    }


}