力扣leetcode 108. 将有序数组转换为二叉搜索树 java

最新推荐文章于 2022-10-17 15:31:42 发布

笨比master

最新推荐文章于 2022-10-17 15:31:42 发布

阅读量241

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/m0_37454852/article/details/102631061

版权

leetcode 专栏收录该内容

288 篇文章 0 订阅

订阅专栏

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode insertNode(int[] nums, int left, int right) {
        if(left >= right) return null;
        int mid = (left + right) / 2;
        TreeNode root = new TreeNode(nums[mid]);
        root.left = insertNode(nums, left, mid);
        root.right = insertNode(nums, mid+1, right);
        return root;
    }
    public TreeNode sortedArrayToBST(int[] nums) {
        return insertNode(nums, 0, nums.length);
    }
}