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

1、题目

https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/submissions/

2、题意

题解1：dfs

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* build(int l,int r,vector<int>&nums)
    {
        if(l>r) return NULL;
        int mid = l+r>>1;//mid = l+r+1>>1;
        TreeNode* root = new TreeNode(nums[mid]);
        root->left = build(l,mid-1,nums);
        root->right = build(mid+1,r,nums);
        return root;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        return build(0,nums.size()-1,nums);
    }
};