Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
BST的定义:
二叉排序树或者是一棵空树,或者是具有下列性质的二叉树:
(1)若左子树不空,则左子树上所有结点的值均小于它的根结点的值;
(2)若右子树不空,则右子树上所有结点的值均大于或等于它的根结点的值;
(3)左、右子树也分别为二叉排序树;
(4)没有键值相等的节点。
因此要从数组中间开始建立节点:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode *sortedArrayToBST(vector<int> &num) {
if (num.size()==0) return NULL;
else
return find(num,0,num.size()-1);
}
TreeNode *find(vector<int>&num,int l,int r){
if(l>r) return NULL;
int mid=(l+r)/2;
TreeNode *root = new TreeNode(num[mid]);
root->left=find(num,l,mid-1);
root->right=find(num,mid+1,r);
return root;
}