LeetCode 108. Convert Sorted Array to Binary Search Tree

最新推荐文章于 2021-09-15 15:18:50 发布

zjxxyz123

最新推荐文章于 2021-09-15 15:18:50 发布

阅读量107

点赞数

分类专栏： LeetCode 文章标签： LeetCode 先序遍历

本文链接：https://blog.csdn.net/zjxxyz123/article/details/80076427

版权

LeetCode 专栏收录该内容

133 篇文章 1 订阅

订阅专栏

问题描述

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
Example：
地址

问题分析

类似先序遍历，dfs
把数组的中间位置作为根，递归数组左右部分，形成左右子树，连在根的后面
时间复杂度，O(N)

代码实现

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

    public TreeNode sortedArrayToBST(int[] nums, int begin, int end) {
        //base case
        if (begin > end) {
            return null;
        }
        if (begin == end) {
            return new TreeNode(nums[begin]);
        }
        //把数组的中间位置作为根，递归数组左右部分，形成左右子树，连在根的后面
        int mid = begin + (end - begin) / 2;
        TreeNode root = new TreeNode(nums[mid]);
        root.left = sortedArrayToBST(nums, begin, mid - 1);
        root.right = sortedArrayToBST(nums, mid + 1, end);
        return root;
    }
}