Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

思路：通过二分法，把数组依次分成两段，中点为父节点，左子树为左边小的半部分，右子树为右边大的半部分。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    
    TreeNode *binaryRebuild(vector<int> &num, int low, int high){
        
        if(low > high)
            return NULL;
        int mid = (low + high)/2;
        TreeNode *parent = new TreeNode(num[mid]);
        parent->left = binaryRebuild(num, low, mid-1);
        parent->right = binaryRebuild(num, mid+1, high);
        return parent;
    }
    TreeNode *sortedArrayToBST(vector<int> &num) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(num.size() <=0 )
            return NULL;
        return binaryRebuild(num, 0, num.size()-1);
    }
};