@@ -0,0 +1,1037 @@
+/**%0A * Created by p1408189 on 6/8/16.%0A */%0Apublic class Main %7B%0A    public static void main(String%5B%5D args) %7B%0A%0A        CharTree ct = new CharTree();%0A%0A        ct.add('f');%0A        ct.add('a');%0A        ct.add('c');%0A        ct.add('x');%0A        ct.add('b');%0A        ct.add('d');%0A%0A        ct.add('d');%0A%0A        ct.add('f');%0A%0A        printBinaryTree(ct.root, 0);%0A%0A        System.out.println(ct.searchIfContains('b'));%0A%0A%0A        System.out.println(ct.countOf('x'));%0A%0A         ct.printInOrder();%0A%0A        System.out.println();%0A%0A        ct.printInOrderIfGreaterThan(1);%0A%0A    %7D%0A%0A%0A%0A    public static void printBinaryTree(CharTreeNode 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.count + root.value);%0A        %7D%0A        else%0A            System.out.println(%22 %22 +root.count + root.value);%0A        printBinaryTree(root.left, level+1);%0A    %7D%0A%7D%0A

Create Main.java