Questions:
Binary tree pre and post order traversals in Java
Write a Java program that loads 12 random integers with the values between 1 and 100 into a tree. Apart from building the tree
1. List the values that have been inserted.
2. Print the tree out in preorder traversal order and then again in postorder traversal order.
3. Print another line showing how deep the tree has become.