108. Convert Sorted Array to Binary Search Tree [Easy]

/**
 * Runtime: 0 ms, faster than 100.00%
 * Memory Usage: 38.5 MB, less than 90.28%
 */
class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return constructor(nums, 0, nums.length - 1);
    }
    private TreeNode constructor(int[] nums, int start, int end) {
        if (start > end) {
            return null;
        }
        int mid = start + (end - start) / 2;
        TreeNode root = new TreeNode(nums[mid]);
        root.left = constructor(nums, start, mid - 1);
        root.right = constructor(nums, mid + 1, end);
        return root;
    }
}