Write a program (in Java) that can convert a sorted array into abalanced binary search tree. For this project, a balanced binarytree is one where the size of the left and right subtrees at eachnode differs at most by one. Your program should have a graphicaluser interface. The program allows the user to enter a number n,generates an array of n random integers, sorts the array, and thenconverts the sorted array into a balanced binary search tree. Theprogram should display a graphical representation of the binarysearch tree.
Solution