3.12 leetcode 将有序数组转换为二叉搜索树

BST的中序遍历是升序的，根据中序遍历的序列恢复二叉搜索树

class Solution

{
	public TreeNode sortedArrayToBST(int[] nums)
		{
			return helper(nums, 0, nums.length-1);
		}
	public TreeNode helper(int[] nums, int left, int right)
	{
		if(left > right)
		{
			return null;
		}
		int mid = (left + right) / 2;
		 TreeNode root = new TreeNode(nums[mid];)
		 root.left = helper(nums, left, mid -1);
		 root.right = helper(nums, mid + 1, right);
		 return root;
	}
}
}