leetcode 108. Convert Sorted Array to Binary Search Tree和1382. Balance a Binary Search Tree

目录

题目描述

108. Convert Sorted Array to Binary Search Tree

1382. Balance a Binary Search Tree

---

题目描述

这两道题构建平衡二叉树的方法是一模一样的。

108. Convert Sorted Array to Binary Search Tree

分治法

/**
 * 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 generate(nums,0,nums.size()-1);
    }

    TreeNode* generate(vector<int>& nums,int left,int right){
        if(left>right)
            return nullptr;
        int mid = left + ((right-left)>>1);
        TreeNode *node = new TreeNode(nums[mid]);
        node->left = generate(nums,left,mid-1);
        node->right= generate(nums,mid+1,right);
        return node;
    }
};

1382. Balance a Binary Search Tree

代码：

/**
 * 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 {
    vector<int> nodevals;
public:
    TreeNode* balanceBST(TreeNode* root) {
        InOrderTra(root);
        return generateBBST(0,nodevals.size()-1);
    }

    void InOrderTra(TreeNode* root){
        if(root == nullptr)
            return;
        InOrderTra(root->left);
        nodevals.push_back(root->val);
        InOrderTra(root->right);
    }

    TreeNode* generateBBST(int left,int right){
        if(left>right)
            return nullptr;
        int mid = left + ((right-left)>>1);
        TreeNode* node = new TreeNode (nodevals[mid]);
        node->left = generateBBST(left,mid-1);
        node->right= generateBBST(mid+1,right);
        return node;
    }
};