Leetcode-108.将有序数组转换为二叉搜索树

最新推荐文章于 2024-08-02 13:44:42 发布

Sun-wz

最新推荐文章于 2024-08-02 13:44:42 发布

阅读量81

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_36318271/article/details/115270280

版权

Leetcode 专栏收录该内容

90 篇文章 0 订阅

订阅专栏

题目背景

Given an integer array nums where the elements are sorted in ascending
order, convert it to a height-balanced binary search tree.

A height-balanced binary tree is a binary tree in which the depth of
the two subtrees of every node never differs by more than one.

Example 1:

Input: nums = [-10,-3,0,5,9] Output: [0,-3,9,-10,null,5] Explanation:
[0,-10,5,null,-3,null,9] is also accepted:

Example 2:

Input: nums = [1,3] Output: [3,1] Explanation: [1,3] and [3,1] are
both a height-balanced BSTs.

Constraints:

1 <= nums.length <= 104
-104 <= nums[i] <= 104 nums is sorted in a strictly increasing order.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/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 sortedArrayToBST(nums,0,nums.size()-1);
    }
    TreeNode* sortedArrayToBST(vector<int>& nums,int l,int r){
        if(r<l)
            return NULL;
        int mid = l+(r-l)/2;
        TreeNode* root = new TreeNode(nums[mid]);
        root->left = sortedArrayToBST(nums,l,mid-1);
        root->right = sortedArrayToBST(nums,mid+1,r);
        return root;
    }
};