1 有序数组
/**
* 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;
}
return arrayto(num,0,num.size()-1);
}
TreeNode *arrayto(vector<int> ivec,int start,int end){
if(start>end){
return NULL ;
}
int mid=start+(end-start)/2+(start+end)%2; //这里要加上(start+end)/%2 从后面的开始
TreeNode *root=new TreeNode(ivec[mid]);
root->left=arrayto(ivec,start,mid-1);
root->right=arrayto(ivec,mid+1,end);
return root;
}
};