/**
* 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* sortedArrayToBST(vector<int>& nums) {
return sortedArrayToBST(nums.begin(),nums.end());
}
template<typename RandomAccessIterator>
TreeNode* sortedArrayToBST(RandomAccessIterator first,RandomAccessIterator last)
{
const auto length=distance(first,last);
if(length<=0)
return nullptr;
auto mid=first+length/2;
TreeNode* root=new TreeNode(*mid);
root->left=sortedArrayToBST(first,mid);
root->right=sortedArrayToBST(mid+1,last);
return root;
}
};
LeetCode Convert Sorted Array to Binary Search Tree 将有序数组转换为二叉搜索树
猜你喜欢
转载自blog.csdn.net/qq_34501451/article/details/83045352
今日推荐
周排行