将有序数组转换为二叉搜索树

108. 将有序数组转换为二叉搜索树 - 力扣（LeetCode） (leetcode-cn.com)

收藏此题目，值得回顾。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {

        return dps(nums,0,nums.size()-1);
    }
private:
    TreeNode* dps(vector<int>& v, int l, int h){
        if(h < l)  return nullptr;
        int mid = l + (h-l)/2;
        TreeNode* node = new TreeNode(v[mid]);
        node->left = dps(v,l,mid-1);
        node->right = dps(v,mid+1,h);
        return node;
    }
};