LeetCode 108. 将有序数组转换为二叉搜索树

108. 将有序数组转换为二叉搜索树

解题思路

取数组中点，递归构造左右子树

当前写法是左闭右闭区间

参考代码

class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return dfs(nums, 0, nums.length - 1);
    }

    private TreeNode dfs(int[] nums, int left, int right) {
        if(left > right) {
            return null;
        }
        int m = (left + right) >>> 1;
        return new TreeNode(nums[m], dfs(nums, left, m - 1), dfs(nums, m + 1, right));
    }
}