[Leetcode] Convert Sorted Array to BST

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 *sortedArrayToBST(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(num.size()==0) return NULL;        
        return sortArray(num,0,num.size()-1);
    }
    
    TreeNode *sortArray(vector<int> &num, int begin, int end)
    {
        if(begin==end)
        {
            TreeNode *root = new TreeNode(num[begin]);
            return root;
        }
        else if(end-begin==1)
        {
            TreeNode *root = new TreeNode(num[begin]);
            TreeNode *rightLeaf = new TreeNode(num[end]);
            root->right = rightLeaf;
            return root;
        }
        else
        {
            int mid = (begin+end)/2;
            TreeNode *root = new TreeNode(num[mid]);
            root->right = sortArray(num,mid+1,end);
            root->left = sortArray(num,begin,mid-1);
            return root;
        }
    }
};