leetcode 日经贴，Cpp code -Convert Sorted Array to Binary Search Tree

bachelorchen

于 2015-05-07 10:50:32 发布

阅读量296

点赞数

分类专栏： Cpp 算法 leetcode

本文链接：https://blog.csdn.net/bachelorchen/article/details/45558027

版权

算法同时被 3 个专栏收录

183 篇文章 0 订阅

订阅专栏

leetcode

173 篇文章 0 订阅

订阅专栏

Cpp

152 篇文章 0 订阅

订阅专栏

Convert Sorted Array to Binary Search Tree

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