leetcode[108]Convert Sorted Array to Binary Search Tree
2015-02-09 13:36
417 查看
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void creatTree(TreeNode *&root,vector<int> &num,int left,int right)
{
if(left>right)return;
int mid=(left+right)/2;
root=new TreeNode(num[mid]);
creatTree(root->left,num,left,mid-1);
creatTree(root->right,num,mid+1,right);
}
TreeNode *sortedArrayToBST(vector<int> &num)
{
TreeNode *root=NULL;
creatTree(root,num,0,num.size()-1);
return root;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 108: Convert Sorted Array to Binary Search Tree
- [Leetcode 108, Meidum] Convert Sorted Array to Binary Search Tree
- LeetCode(108)Convert Sorted Array to Binary Search Tree
- LeetCode108_Convert SortedArray to BinarySearchTree(将有序数组转成二叉排序树) Java题解
- LeetCode: Convert Sorted Array to Binary Search Tree [108]
- [LeetCode]108 Convert Sorted Array to Binary Search Tree
- LeetCode 108: Convert Sorted Array to Binary Search Tree
- LeetCode（108） Convert Sorted Array to Binary Search Tree
- leetcode[108]:Convert Sorted Array to Binary Search Tree
- LeetCode 108 Convert Sorted Array to Binary Search Tree
- LeetCode_108 Convert Sorted Array to Binary Search Tree
- [leetcode 108] Convert Sorted Array to Binary Search Tree
- Leetcode 108 Convert Sorted Array to Binary Search Tree
- Leetcode 108 Convert Sorted Array to Binary Search Tree
- [leetcode-108]Convert Sorted Array to Binary Search Tree(java)
- Convert Sorted Array to Binary Search Tree - LeetCode 108
- [Leetcode 32] 108 Convert Sorted Array to Binary Search Tree
- Leetcode 108 Convert Sorted Array to Binary Search Tree 有序数组构造平衡二叉查找树
- LeetCode(108) Convert Sorted Array to Binary Search Tree
- [LeetCode]: 108: Convert Sorted Array to Binary Search Tree