Very Simple Java Solution
public class Solution {\n      public TreeNode sortedArrayToBST(int[] nums) {\n        return helper(nums, 0, nums.length-1);\n      }\n    \n      private Tree
    public class Solution {\n      public TreeNode sortedArrayToBST(int[] nums) {\n        return helper(nums, 0, nums.length-1);\n      }\n    \n      private TreeNode helper(int[] nums, int l, int r){\n        if (l>r) return null;\n        if (l==r) return new TreeNode(nums[l]);\n        int mid = (l+r)/2;\n        TreeNode root = new TreeNode(nums[mid]);\n        root.left = helper(nums, l, mid-1);\n        root.right = helper(nums, mid+1, r);\n        return root;\n      }\n    }
['Binary Tree', 'Java']