Main3.java

public class Main3 {

    public static void main(String[] args) {
        BinarySearchTree tree = new BinarySearchTree();

        Integer[] numbers = {40,30,50,20,35,45,55,10,25,32,42,5};

        for(Integer number : numbers)
            tree.add(number);

        System.out.println(tree.toString());

        System.out.println("In order:");
        tree.InOrder();
        //Output: 5, 10, 20, 25, 30, 32, 35, 40, 42, 45, 50, 55

        System.out.println("\nPre order:");
        tree.PreOrder();
        //Output: 40, 30, 20, 10, 5, 25, 35, 32, 50, 45, 42, 55

        System.out.println("\nPost order:");
        tree.PostOrder();
        //Output: 5, 10, 25, 20, 32, 35, 30, 42, 45, 55, 50, 40

        System.out.println("\nDescending");
        tree.DescendingOrder();
        //Output: 55, 50, 45, 42, 40, 35, 32, 30, 25, 20, 10, 5


    }
}