Write a recursive Binary Tree traversal program in Java (do not use the built in class) to

1) insert the numbers: use 47, 32, 59, 62, 21

2) Print those numbers out in order (go left, visit, go right).

3) Print those numbers out pre-order (visit, go left, go right).

4) Print those numbers out post-order (go left, go right, visit).