【LeetCode】108. 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

给一个按升序排好的数组，构造成平衡二叉树。平衡二叉树的特点如下：

1. 若任意节点的左子树不为空，则左子树所有节点的值小于根节点的值；

2. 若任意节点的右子树不为空，则右子树所有节点的值大于根节点的值；

3. 它是一颗空树或左右子树的高度差的绝对值不超过1，且左右子树都是二叉树。

对于已经排序好的数组，用中间元素作为根节点，中间元素的左半部分创建左子树，右半部分创建右子树。由于递归创建每一层的左右子树，所以左右子树的高度差不会超过1。

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