Subversion Repositories programming

        BinaryTree tree1 = createTreeOne();

        BinaryTree tree2 = createTreeTwo();

        BinaryTree tree3 = createTreeThree();

        System.out.println("Testing getter methods...");

        System.out.println("root: " + tree3.getRoot());

        System.out.println("left: " + tree3.getLeft());

        System.out.println("right: " + tree3.getRight());

        System.out.println("Testing setter and toString methods...");

        tree1.setRoot("A");

        tree1.setLeft( new BinaryTree("B"));

        tree1.setRight( new BinaryTree("C"));

        System.out.println("tree1: " + tree1 ); //should print ((A),B,(C))

        System.out.println("Testing misc methods...");

        System.out.println("tree1.isLeaf(): " + tree1.isLeaf());

        System.out.println("tree1.left.isLeaf(): " + tree1.getLeft().isLeaf());

        //

        System.out.println("tree3.size(): " + tree3.size());

        System.out.println("tree3.height(): " + tree3.height());

        System.out.println("tree3.contains(\"2\"): " + tree3.contains("2"));

        System.out.println("tree3.contains(\"zZ\"): " + tree3.contains("zZ"));

    }

    public static BinaryTree createTreeOne() {

        return new BinaryTree("H");

    public static BinaryTree createTreeTwo() {

        BinaryTree treeA = new BinaryTree("A");

        BinaryTree treeC = new BinaryTree("C");

        BinaryTree treeE = new BinaryTree("E");

        BinaryTree treeG = new BinaryTree("G");

        BinaryTree treeI = new BinaryTree("I");

        BinaryTree treeK = new BinaryTree("K");

        BinaryTree treeM = new BinaryTree("M");

        BinaryTree treeO = new BinaryTree("O");

        BinaryTree treeB = new BinaryTree("B",treeA,treeC);

        BinaryTree treeF = new BinaryTree("F",treeE,treeG);

        BinaryTree treeJ = new BinaryTree("J",treeI,treeK);

        BinaryTree treeN = new BinaryTree("N",treeM,treeO);

        BinaryTree treeD = new BinaryTree("D",treeB,treeF);

        BinaryTree treeL = new BinaryTree("L",treeJ,treeN);

        BinaryTree treeH = new BinaryTree("H",treeD,treeL);

        return treeH;

    }

    public static BinaryTree createTreeThree() {

        BinaryTree tree_2 = new BinaryTree("2");

        BinaryTree tree_a1 = new BinaryTree("a");

        BinaryTree tree_t1 = new BinaryTree("t");

        BinaryTree tree_c1 = new BinaryTree("c");

        BinaryTree tree_a2 = new BinaryTree("a");

        BinaryTree tree_s1 = new BinaryTree("s",null,tree_2);

        BinaryTree tree_n = new BinaryTree("n");

        BinaryTree tree_s2 = new BinaryTree("s",tree_a1,tree_t1);

        BinaryTree tree_a3 = new BinaryTree("a");

        BinaryTree tree_l1 = new BinaryTree("l",tree_c1,tree_a2);

        BinaryTree tree_c2 = new BinaryTree("c",null,tree_s1);

        BinaryTree tree_i1 = new BinaryTree("i");

        BinaryTree tree_t2 = new BinaryTree("t",tree_n,tree_s2);

        BinaryTree tree_l2 = new BinaryTree("l");

        BinaryTree tree_t3 = new BinaryTree("t",tree_a3,tree_l1);

        BinaryTree tree_s3 = new BinaryTree("s");

        BinaryTree tree_4 = new BinaryTree("4",tree_c2,null);

        BinaryTree tree_s4 = new BinaryTree("s",tree_i1,null);

        BinaryTree tree_f = new BinaryTree("f");

        BinaryTree tree_i2 = new BinaryTree("i",tree_t2,null);

        BinaryTree tree_a4 = new BinaryTree("a");

        BinaryTree tree_y = new BinaryTree("y",tree_l2,null);

        BinaryTree tree_r = new BinaryTree("r");

        BinaryTree tree_s5 = new BinaryTree("s",tree_t3,tree_s3);

        BinaryTree tree_1 = new BinaryTree("1",tree_4,tree_s4);

        BinaryTree tree_a5 = new BinaryTree("a",tree_f,tree_i2);

        BinaryTree tree_l3 = new BinaryTree("l",tree_a4,tree_y);

        BinaryTree tree_e = new BinaryTree("e",tree_r,tree_s5);

        BinaryTree tree_a6 = new BinaryTree("a",tree_1,tree_a5);

        BinaryTree tree_g = new BinaryTree("g",tree_l3,tree_e);

        BinaryTree tree_c3 = new BinaryTree("c",tree_a6,tree_g);

        return tree_c3;

    }