LeetCode-Convert Sorted Array to Binary Search Tree

最新推荐文章于 2019-01-05 19:50:00 发布

原创最新推荐文章于 2019-01-05 19:50:00 发布 · 338 阅读

0 ·

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

标签

#leetcode #Convert Sorted Array

Cracking LeetCode 同时被 3 个专栏收录

152 篇文章

订阅专栏

Tree

26 篇文章

订阅专栏

Recursion

24 篇文章

订阅专栏

本文介绍了一种将已排序的数组转换为高度平衡的二叉搜索树的方法。通过递归地选取中间元素作为根节点，并将左右两边的子数组分别构建为左子树和右子树，确保了树的高度平衡。

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

Solution:

Code:

<span style="font-size:14px;">/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode *helper(const vector<int> &num, int begin, int end) {
        if (begin > end) return NULL;
        int mid = (begin+end)/2;
        TreeNode *root = new TreeNode(num[mid]);
        root->left = helper(num, begin, mid-1);
        root->right = helper(num, mid+1, end);
        return root;
    }
    
    TreeNode *sortedArrayToBST(vector<int> &num) {
        return helper(num, 0, num.size()-1);
    }
};</span>