108_ConvertSortedArraytoBinarySearchTree - a920604a/leetcode GitHub Wiki

class Solution {
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        if(nums.empty()) return nullptr;
        int n = nums.size();
        TreeNode *root = new TreeNode(nums[n/2]);
        vector<int> left(nums.begin(), nums.begin()+n/2);
        vector<int> right(nums.begin()+n/2+1, nums.end());
        root->right = sortedArrayToBST(right);
        root->left = sortedArrayToBST(left);
        return root;
    }
};