问题描述:给一个排序数组(从小到大),将其转换为一棵高度最小的排序二叉树。
注意事项There may exist multiple valid solutions, return any of them.
样例
给出数组 [1,2,3,4,5,6,7]
, 返回
4
/ \
2 6
/ \ / \
1 3 5 7
然后递归对这两个新的数组进行相同的处理 。
代码:/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param A: A sorted (increasing order) array
* @return: A tree node
*/
TreeNode *sortedArrayToBST(vector<int> &A) {
// write your code here
if(A.size()==0) return NULL;
int start=0,end=A.size()-1;
int mid=(start+end)/2;
TreeNode *head=new TreeNode(A[mid]);
head->left=sorteArray(A,start,mid-1);
head->right=sorteArray(A,mid+1,end);
return head;
}
TreeNode *sorteArray(vector<int> &A,int start,int end)
{if(start>end) return NULL;
int mid=(start+end)/2;
TreeNode *head=new TreeNode(A[mid]);
head->left=sorteArray(A,start,mid-1);
head->right=sorteArray(A,mid+1,end);
return head;
}
};