@@ -0,0 +1,1181 @@
+/**%0A * Created by bokense on 05-Jun-16.%0A */%0Apublic class Main %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        IntTree myTree1 = new IntTree();%0A%0A        myTree1.add(12);%0A        myTree1.add(4);%0A        myTree1.add(15);%0A        myTree1.add(1);%0A        myTree1.add(6);%0A        myTree1.add(13);%0A        myTree1.add(5);%0A        myTree1.add(14);%0A        printBinaryTree(myTree1.root,0);%0A%0A        System.out.println(myTree1.searchIfContains(321831));%0A%0A        System.out.println(myTree1.countNodes());%0A%0A        System.out.println(myTree1.maxHeight());%0A%0A%0A        myTree1.printPreOrder();%0A        System.out.println();%0A        myTree1.printLevelOrder2(myTree1.root);%0A%0A        myTree1.paintInOrder();%0A%0A        myTree1.paintInOrderDown();%0A%0A%0A%0A    %7D%0A%0A    public static void printBinaryTree(IntTreeNode root, int level)%7B%0A        if(root==null)%0A            return;%0A        printBinaryTree(root.right, level+1);%0A        if(level!=0)%7B%0A            for(int i=0;i%3Clevel-1;i++)%0A                System.out.print(%22%7C%5Ct%22);%0A            System.out.println(%22%7C-------%22+root.value);%0A        %7D%0A        else%0A            System.out.println(root.value);%0A        printBinaryTree(root.left, level+1);%0A    %7D%0A%7D%0A

Create Main.java