Convert Sorted Array to Binary Search Tree LeetCode solution in Java

1
class Solution {
2
  public TreeNode sortedArrayToBST(int[] nums) {
3
    if (nums.length == 0) return null;
4
    var mid = nums.length / 2;
5
    var root = new TreeNode(nums[mid]);
6
    var left_array = Arrays.copyOfRange(nums, 0, mid);
7
    var right_array = Arrays.copyOfRange(nums, mid + 1, nums.length);
8
    root.left = sortedArrayToBST(left_array);
9
    root.right = sortedArrayToBST(right_array);
10
    return root;
11
  }
12
}