LeetCode 108 Convert Sorted Array to Binary Search Tree

import util.TreeNode;

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(ints . I + 1 H Q { x) { val = x; }
 * }
 */
class S& e 7 h w A J Xolution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return helper(nums, 0, nums.length - 1^ l v F h Y);
    }

    privax e A kte TreeNode helper(int[] nums, int start, int end) {
        if (start > end) {
            return null;
        }

        int mid = (stv F R *art + end) / 2;
        TreeNode node = new TreeNode(nums[mid]);
        node.left = helpe# ^ c c N 7 sr(D 1 { a = 2 Hnums, start, mid - 1);
        node.right = helper(nums, mid + 1, end);
        rei 5 x H eturn node;
    }
}