24 [数组] 将有序数组转换为二叉搜索树 -108

努力向大佬看齐

已于 2023-05-05 16:58:45 修改

阅读量81

点赞数

分类专栏： LeetCode 文章标签：深度优先算法

于 2022-10-07 14:57:46 首次发布

本文链接：https://blog.csdn.net/m0_52562878/article/details/127194409

版权

LeetCode 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

二叉搜索树的中序遍历是升序序列

选择中间数字作为根节点，可以保持树的平衡

mid = left + (right - left)/2;这种求中间数的方式可以防止数的溢出

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
          return dfs(nums,0,nums.length - 1);
    }

    TreeNode dfs(int[] nums,int left,int right){
        if(left <= right){
        int mid = left + (right - left)/2;
        TreeNode node = new TreeNode(nums[mid]);
        node.left = dfs(nums,left,mid - 1);
        node.right = dfs(nums, mid + 1,right);
        return node;
        }
         return null;
    }
}