1.108. 将有序数组转换为二叉搜索树 - 力扣(LeetCode)
2.avl的构建一般采用二分的方法,类似于快排递归格式
class Solution {
public:
TreeNode*help(vector<int>&nums,int left,int right)
{
if(left>right)
{
return nullptr;
}
int mid=(left+right)/2;
TreeNode*root=new TreeNode(nums[mid]);
root->left=help(nums,left,mid-1);
root->right=help(nums,mid+1,right);
return root;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
return help(nums,0,nums.size()-1);
}
};