LeetCode-Convert Sorted Array to Binary Search Tree

xyprojectd

于 2014-04-20 16:36:30 发布

阅读量391

点赞数

分类专栏： LeetCode 文章标签： Algorithm BST Array

本文链接：https://blog.csdn.net/xyxyxyj/article/details/24185657

版权

LeetCode 专栏收录该内容

21 篇文章

订阅专栏

#include <iostream>
#include <vector>
using namespace std;

struct TreeNode
{
    int val;
    TreeNode* left;
    TreeNode* right;
};

TreeNode* ArrayToBST(vector<int>&num,int left,int right)
{
    if(left>right)
        return NULL;
    int mid=left+((right-left)>>1);
    
    TreeNode* root=(TreeNode*)malloc(sizeof(TreeNode));
    root->val=num[mid];
    
    root->left=ArrayToBST(num, left, mid-1);
    root->right=ArrayToBST(num, mid+1, right);
    
    return root;
}
TreeNode *sortedArrayToBST(vector<int> &num)
{
    int left=0;
    int right=num.size()-1;
    if(num.size()<=0)
        return NULL;
    
    TreeNode *root=ArrayToBST(num, left, right);
    return root;
}