Write a program that creates a Binary Tree from an array of integers, goes through it using inorder traversal (saving that to another array), then makes another balanced binary tree. Need this written in JAVA using integer array and an integer Binary tree (do not use a generic tree please). I want to be able to compare my code to what is submitted and see where I am going wrong.