177. 把排序数组转换为高度最小的二叉搜索树。
给一个排序数组(从小到大),将其转换为一棵高度最小的二叉搜索树。
样例
样例 1:
输入:[]
输出:{}
解释:二叉搜索树为空
样例 2:
输入:[1,2,3,4,5,6,7]
输出: {4,2,6,1,3,5,7}
解释:
拥有最小高度的二叉搜索树
4
/ \
2 6
/ \ / \
1 3 5 7
注意事项
There may exist multiple valid solutions, return any of them.
TreeNode * createTree(vector<int> &A,int start,int end)
{
if(start > end)
{
return NULL;
}
if(start == end)
{
TreeNode * node = new TreeNode(A[start]);
return node ;
}
int mid = (start + end) /2;
TreeNode * node = new TreeNode(A[mid]);
node->left = createTree(A,start,mid-1);
node->right = createTree(A,mid+1,end);
return node;
}
TreeNode * sortedArrayToBST(vector<int> &A) {
// write your code here
if(A.empty())
{
return NULL;
}
int mid = A.size() /2;
TreeNode * root = new TreeNode(A[mid]);
root->left = createTree(A,0,mid-1);
root->right = createTree(A,mid+1,A.size()-1);
return root;
}