leetcode 108 递归-二分有序数组转换为二叉搜索树

最新推荐文章于 2026-02-07 22:25:03 发布

原创最新推荐文章于 2026-02-07 22:25:03 发布 · 190 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode练习

本文详细解析了LeetCode上的两道经典题目：将有序数组转换为平衡二叉搜索树(LeetCode 108)和将有序链表转换为平衡二叉搜索树(LeetCode 109)。通过递归算法，我们实现了创建平衡二叉搜索树的过程，确保了树的高度尽可能地小，从而提高了搜索效率。

leetcode 108

/**
 * 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* Create(vector<int>&nums,int left,int right){
        if(left>right){
            return NULL;
        }
        int mid=(left+right)/2;
        TreeNode* root=new TreeNode(nums[mid]);
        root->left=Create(nums,left,mid-1);
        root->right=Create(nums,mid+1,right);
        return root;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        if(nums.size()==0)return NULL;
        TreeNode* root=Create(nums,0,nums.size()-1);
        return root;
    }


};

leetcode 109

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
/**
 * 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* sortedListToBST(ListNode* head) {
        vector<int> vec;
        while(head!=NULL){
            vec.push_back(head->val);
            head=head->next;
        }
        TreeNode* root=buildtree(vec,0,vec.size()-1);
        return root;
    }
    //建立从[left,right]的平衡树
    TreeNode* buildtree(vector<int>& v,int left,int right){
        if(left>right){
            return NULL;
        }
        int mid=(left+right)/2;
        TreeNode* root=new TreeNode(v[mid]);
        root->left=buildtree(v,left,mid-1);
        root->right=buildtree(v,mid+1,right);
        return root;
    }

};