LeetCode--Convert Sorted Array to Binary Search Tree

最新推荐文章于 2017-12-04 17:10:15 发布

Never-guess

最新推荐文章于 2017-12-04 17:10:15 发布

阅读量551

点赞数

分类专栏： leetcode LeetCode代码思路文章标签：搜索二分法递归二叉树中点

本文链接：https://blog.csdn.net/qq_20791919/article/details/78693762

版权

leetcode 同时被 2 个专栏收录

89 篇文章 0 订阅

订阅专栏

LeetCode代码思路

89 篇文章 2 订阅

订阅专栏

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:

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

思路：二分法。递归找到中点，然后分配左右子树，直到没有可分配的就返回空节点。

/**
 * 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) {
        return sortedArrayToBST(nums,0,nums.size()-1);
    }
    TreeNode* sortedArrayToBST(vector<int>nums,int left,int right){
        if (left>right) return NULL;
        int mid=(left+right)/2;
        TreeNode *cur=new TreeNode(nums[mid]);
        cur->left=sortedArrayToBST(nums,left,mid-1);
        cur->right=sortedArrayToBST(nums,mid+1,right);
        return cur;
    }
};