LeetCode-Convert Sorted Array to Binary Search Tree
2014-04-20 16:36
423 查看
#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;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode108—Convert Sorted Array to Binary Search Tree
- Leetcode:convert_sorted_array_to_binary_search_tree
- Convert Sorted Array to Binary Search Tree——LeetCode
- [leetcode]Convert Sorted Array to Binary Search Tree
- LeetCode:Convert Sorted Array to Binary Search Tree
- 【leetcode】Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree - leetcode
- [leetcode][108]. Convert Sorted Array to Binary Search Tree
- LeetCode——Convert Sorted Array to Binary Search Tree
- leetcode - Convert Sorted Array to Binary Search Tree
- LeetCode_108 Convert Sorted Array to Binary Search Tree
- [LeetCode] Convert Sorted Array to Binary Search Tree
- LeetCode——Convert Sorted Array to Binary Search Tree
- LeetCode:Convert Sorted Array to Binary Search Tree
- [LeetCode-23] Convert Sorted Array to Binary Search Tree
- [Leetcode]Convert Sorted Array to Binary Search Tree
- 【LeetCode】Convert Sorted Array to Binary Search Tree
- *(leetcode) Convert Sorted Array to Binary Search Tree (tree)
- LeetCode - Convert Sorted Array to Binary Search Tree
- LeetCode-Convert Sorted Array to Binary Search Tree