[LeetCode] Convert Sorted Array to Binary Search Tree

Each time choose the middle element as the root, recursively build the 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 *sortHelper(vector<int> &num, int beg, int end)
    {
        if(beg>end) return NULL;
        int mid=(beg+end)/2;
        TreeNode *node = new TreeNode(num[mid]);
        node->left=sortHelper(num,beg,mid-1);
        node->right=sortHelper(num,mid+1,end);
        return node;
    }
    TreeNode *sortedArrayToBST(vector<int> &num) {
        return sortHelper(num,0,num.size()-1);
    }
}