Convert Sorted Array to Binary Search Tree

题目描述：

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

二分法来解决，一次AC，代码如下：

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