Java program

Write a program in Java, which generates a self-balances AVL tree from a series of integer provided from a single string on the command line and display (to the screen) the pre-order, post-order, and in-order traversal of the resulting tree. 
For example: 
java edu.texas.cos311.bjames.prog1 “1 2 3 4 5 6 7”
PREORDER: 4 2 1 3 6 5 7
POSTORDER: 1 3 2 5 7 6 4
INORDER: 1 2 3 4 5 6 7