This is in Java

If we are to build a BST with an already sorted data set, we will end up with a skewed tree. Assuming sorted data is stored in an array, write a recursive method to build a balanced Binary Search Tree