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，且其两个子树也是平衡二叉树。

因此，我们可以将数组的中间元素作为根节点，选取左半部份数组来构建左子树，选取右半部份来构建右子树，这样便可满足搜索树的性质，同时，其左右子树的高度差即可满足不超过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) {
        if(nums.empty())
            return NULL;
        int middle = nums.size() / 2;
        TreeNode *root = new TreeNode(nums[middle]);
        vector<int> v_left = vector<int>(nums.begin(), nums.begin() + middle);
        vector<int> v_right = vector<int>(nums.begin() + middle + 1, nums.end());
        root->left = sortedArrayToBST(v_left);
        root->right = sortedArrayToBST(v_right);
        return root;
    }
};