给定有序数组，创建高度最小的二叉查找树

TreeNode createMinimalBST(int arr[], int start, int end)

{

if (end < start)

{

return null;

}

int mid = start + (end - start) / 2;

TreeNode n=new TreeNode(arr[mid]);

n.left=createMinimalBST(arr,start,mid-1);

n.right=createMinimalBST(arr,mid+1,end);

return n;

}

TreeNode createMinimalBST(int array[])

{

return createMinimalBST(array,0,array.length-1);

}