Tree

public class Main {
    public static void main(String[] args) {
        BinNode<Integer> tree = new BinNode<Integer>(1);
        tree.setLeft(new BinNode<Integer>(3));
        tree.getLeft().setLeft(new BinNode<Integer>(2));
        tree.setRight(new BinNode<Integer>(3));
        tree.getRight().setLeft(new BinNode<Integer>(2));
        tree.getRight().setRight(new BinNode<Integer>(3));
        tree.getRight().getRight().setRight(new BinNode<Integer>(2));


        BinNode<Integer> tree2 = new BinNode<Integer>(0);
        tree2.setLeft(new BinNode<Integer>(3));
        tree2.setRight(new BinNode<Integer>(1));
        tree2.getLeft().setLeft(new BinNode<Integer>(2));
        tree2.getRight().setRight(new BinNode<Integer>(2));
        tree2.getRight().setLeft(new BinNode<Integer>(5));

        BinNode<Character> treeE = new BinNode<Character>('a');
        treeE.setLeft(new BinNode<Character>('a'));
        treeE.setRight(new BinNode<Character>('a'));
        treeE.getLeft().setLeft(new BinNode<Character>('a'));
        treeE.getRight().setRight(new BinNode<Character>('a'));
        treeE.getRight().setLeft(new BinNode<Character>('a'));

        BinNode<Integer> treeL = new BinNode<Integer>(1);
        treeL.setLeft(new BinNode<Integer>(3));
        treeL.setRight(new BinNode<Integer>(2));
        treeL.getLeft().setLeft(new BinNode<Integer>(2));
//        System.out.println("Starter");
//        Functions.starterPrint(tree);
//        System.out.println();
//        System.out.println("Inner");
//        Functions.innerPrint(tree);
//        System.out.println();
//        System.out.println("End");
//        Functions.endPrint(tree);
//        System.out.println();
//        System.out.println("Starter Even");
//        Functions.starterPrintEven(tree);
//        System.out.println();
//        System.out.println("Starter Father Bigger");
//        Functions.starterPrintSmallerThanFather(tree);
//        BinNode<Integer> tree2 = new BinNode<Integer>(4);
//        tree2.setLeft(new BinNode<Integer>(3));
//        tree2.setRight(new BinNode<Integer>(2));
//        tree2.getLeft().setLeft(new BinNode<Integer>(1));
//        tree2.getLeft().setRight(new BinNode<Integer>(0));
//        System.out.println();
//        System.out.println("Starter 2 Sons Bigger");
//        Functions.starterPrint2SonsBigger(tree2);
//        System.out.println(Functions.Sum(tree));
//        System.out.println();
//        System.out.println(Functions.NumIn(tree, 2));
//        System.out.println();
//        System.out.println(Functions.leafCount(tree));
//        System.out.println();
//        System.out.println(Functions.evenNums(tree));
//        System.out.println(Functions.isInTree(tree, 5));
//        System.out.println(Functions.twoSonsEqual(treeE));
//        System.out.println(Functions.isLeftSmaller(tree));
//        System.out.println(Functions.isLeftSmaller(tree2));
//        System.out.println(Functions.binToNode(tree).toString());
//        System.out.println();
//        Functions.starterPrint(tree);
//        Functions.addNumLeft(tree,1);
//        System.out.println();
//        Functions.starterPrint(tree);


        BinNode<Integer> tree3 = new BinNode<Integer>(1);
        tree3.setLeft(new BinNode<Integer>(2));
        tree3.getLeft().setLeft(new BinNode<Integer>(2));
        tree3.setRight(new BinNode<Integer>(3));

        BinNode<Integer> tree4 = new BinNode<Integer>(1);
        tree4.setLeft(new BinNode<Integer>(3));
        tree4.setRight(new BinNode<Integer>(2));
        tree4.getRight().setRight(new BinNode<Integer>(2));




//        BinNodeFunctions.starterPrint(treeL);
//        BinNodeFunctions.removeLeafByParams(treeL,2);
//        System.out.println();
//        BinNodeFunctions.starterPrint(treeL);
//        System.out.println();
//        System.out.println("Num is on level  " + BinNodeFunctions.leafLevel(tree2,5) );
//        System.out.println();
//        System.out.println(BinNodeFunctions.isPoli(tree3,tree4));
//        System.out.println();

        Node<Integer> node = BinNodeFunctions.trees2Node(tree3,tree4);
        System.out.println(node.toString());
        System.out.println(BinNodeFunctions.binToNode(tree3));

    }
}