JAVA || Easy Solution With Explanation || 100% Faster Code.
\tPLEASE UPVOTE IF YOU LIKE.\n\nclass Solution {\n    //Runtime: 0 ms, faster than 100.00% of Java online submissions for Convert Sorted Array to Binary Search 
\tPLEASE UPVOTE IF YOU LIKE.\n```\nclass Solution {\n    //Runtime: 0 ms, faster than 100.00% of Java online submissions for Convert Sorted Array to Binary Search Tree.\n    //Memory Usage: 43.8 MB, less than 47.11% of Java online submissions for Convert Sorted Array to Binary Search Tree.\n    //recursive solution\n    //DFS: pre-order\n    //Time: O(N) ; Space:  O(logN)\n    public TreeNode sortedArrayToBST(int[] nums) {\n        return helper_binaryBuilder(nums,0, nums.length-1) ;\n    }\n\n    private TreeNode helper_binaryBuilder(int[] nums, int left, int right){\n        if (left > right) return null;\n        int m = (right + left) / 2;\n        TreeNode root = new TreeNode(nums[m]);\n        root.left = helper_binaryBuilder(nums, left, m - 1);\n        root.right = helper_binaryBuilder(nums, m + 1, right);\n        return root;\n    }\n}\n```
['Recursion', 'Java']