/**
 * Created by bokense on 05-Jun-16.
 */
public class Main {

    public static void main(String[] args) {
        IntTree myTree1 = new IntTree();

        myTree1.add(12);
        myTree1.add(4);
        myTree1.add(15);
        myTree1.add(1);
        myTree1.add(6);
        myTree1.add(13);
        myTree1.add(5);
        myTree1.add(14);
        printBinaryTree(myTree1.root,0);

        System.out.println(myTree1.searchIfContains(321831));

        System.out.println(myTree1.countNodes());

        System.out.println(myTree1.maxHeight());


        myTree1.printPreOrder();
        System.out.println();
        myTree1.printLevelOrder2(myTree1.root);

        myTree1.paintInOrder();

        myTree1.paintInOrderDown();



    }

    public static void printBinaryTree(IntTreeNode root, int level){
        if(root==null)
            return;
        printBinaryTree(root.right, level+1);
        if(level!=0){
            for(int i=0;i<level-1;i++)
                System.out.print("|\t");
            System.out.println("|-------"+root.value);
        }
        else
            System.out.println(root.value);
        printBinaryTree(root.left, level+1);
    }
}

@@ -1,42 +1,97 @@
-/**%0A * Created by bokense on 05-Jun-16
+import java.util.LinkedList;%0Aimport java.util.Queue;%0A%0A/**%0A * Created by highnet on 2016-06-14
 .%0A *
@@ -112,17 +112,16 @@
  Main %7B%0A
-%0A
     publ
@@ -157,16 +157,17 @@
 args) %7B%0A
+%0A
         
@@ -245,17 +245,18 @@
 ee1.add(
-4
+77
 );%0A     
@@ -296,16 +296,17 @@
 e1.add(1
+2
 );%0A     
@@ -320,17 +320,18 @@
 ee1.add(
-6
+32
 );%0A     
@@ -370,16 +370,17 @@
 ee1.add(
+4
 5);%0A    
@@ -400,16 +400,17 @@
 dd(14);%0A
+%0A
         
@@ -439,32 +439,33 @@
 1.root,0);%0A%0A
+%0A
         
 System.out.p
@@ -456,59 +456,240 @@
     
-System.out.println(myTree1.searchIfContains(321831)
+IntTree myTree2 = new IntTree();%0A%0A        myTree2.add(12);%0A        myTree2.add(77);%0A        myTree2.add(15);%0A        myTree2.add(121);%0A        myTree2.add(32);%0A        myTree2.add(13);%0A        myTree2.add(45);%0A        myTree2.add(14
 );%0A%0A
@@ -727,24 +727,28 @@
 ee1.
-countNodes(
+equals(myTree2
 ));%0A%0A
+%0A
     
@@ -774,26 +774,31 @@
 tln(
-myTree1.maxHeight(
+equals2(myTree1,myTree2
 ));%0A
@@ -807,67 +807,204 @@
     
+%7D%0A%0A
     
+private static boolean equals2(IntTree 
 myTree1
-.printPreOrder();%0A        System.out.println
+, IntTree myTree2) %7B%0A%0A        Queue%3CInteger%3E myTree1_values = new LinkedList%3C%3E();%0A        Queue%3CInteger%3E myTree2_values = new LinkedList%3C%3E
 ();%0A
+%0A
     
@@ -1020,31 +1020,25 @@
 e1.p
-rintLevelOrder2
+ushValues
 (myTree1
 .roo
@@ -1037,17 +1037,18 @@
 ree1
-.root
+_values
 );%0A
-%0A
     
@@ -1061,73 +1061,100 @@
 Tree
-1.paintInOrder();%0A%0A        myTree1.paintInOrderDown();%0A%0A%0A
+2.pushValues(myTree2_values);%0A%0A        return myTree1_values.equals(myTree2_values);
 %0A    %7D%0A%0A
     
@@ -1149,26 +1149,28 @@
 %0A    %7D%0A%0A
+%0A
     p
-ublic
+rivate
  static 

Update Main.java