CareerCup 4.3

最新推荐文章于 2017-12-01 13:23:00 发布

H_Arbiter

最新推荐文章于 2017-12-01 13:23:00 发布

阅读量412

点赞数

分类专栏： CareerCup 150

本文链接：https://blog.csdn.net/H_Arbiter/article/details/9224093

版权

CareerCup 150 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

4.3 Given a sorted (increasing order) array, write an algorithm to create a binary search tree with minimal height.

struct TreeNode {
    int val;
    TreeNode *left, *right;
    TreeNode(int v) : val(v), left(NULL), right(NULL) {}
};

TreeNode* createBST(vector<int> &arr, int l, int r) {
    if (l > r) {
        return NULL;
    }
    int m = (l + r) >> 1;
    TreeNode *node = new TreeNode(arr[m]);
    node->left = createBST(arr, l, m - 1);
    node->right = createBST(arr, m + 1, r);
    return node;
}

TreeNode* createBST(vector<int> &arr) {
    return createBST(arr, 0, arr.size()-1);
}