LeetCode108：把有序数组转换成二叉搜索树

最新推荐文章于 2020-06-28 10:51:17 发布

独L无二

最新推荐文章于 2020-06-28 10:51:17 发布

阅读量113

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/sinat_31275315/article/details/104193175

版权

LeetCode 专栏收录该内容

70 篇文章 0 订阅

订阅专栏

该博客讨论了如何将升序排列的数组转换为高度平衡的二叉搜索树，其中定义高度平衡的二叉树是每个节点的两个子树深度之差不超过1的树。并提供了一个例子。

摘要由CSDN通过智能技术生成

https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

问题描述

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:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

Solution

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        if(nums.empty())
            return nullptr;
        
        int mid = (nums.size()) / 2;
        TreeNode* pRoot = new TreeNode(nums[mid]);
        
        auto iter = nums.begin();
        vector<int> leftVec;
        leftVec.assign(iter, iter + mid);
        vector<int> rightVec;
        rightVec.assign(iter + mid + 1, nums.end());
        
        pRoot->left = sortedArrayToBST(leftVec);
        pRoot->right = sortedArrayToBST(rightVec);
        
        return pRoot;
    }
};