LeetCode-Convert Sorted Array to Binary Search Tree

最新推荐文章于 2024-09-22 11:42:19 发布

tymy

最新推荐文章于 2024-09-22 11:42:19 发布

阅读量372

点赞数

分类专栏： leetCode 文章标签： LeetCode IT面试 OJ 算法

本文链接：https://blog.csdn.net/u010266551/article/details/9989987

版权

leetCode 专栏收录该内容

123 篇文章 0 订阅

订阅专栏

/**
 * 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 *sortedArrayToBST(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        return trans(num, 0, num.size() - 1);
    }
    
    TreeNode *trans(vector<int> &num, int left, int right)
    {
        if (left > right)
        {
            return NULL;
        }
        int mid = (right + left) >> 1;
        TreeNode *ptr = new TreeNode(num[mid]);
        ptr->left = trans(num, left, mid - 1);
        ptr->right = trans(num, mid + 1, right);
        return ptr;
    }
};