108. Convert Sorted Array to Binary Search Tree

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

源码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
    if(nums==null||nums.length==0)return null;
        TreeNode head=sortedArrayToBSTHelp(nums, 0, nums.length-1);
        return head;
    }
    
    public TreeNode sortedArrayToBSTHelp(int[] nums,int start,int end)
    {
        if(start>end)
        {
            return null;
        }
        else
        {
            int medium=(start+end)/2;
            TreeNode treeNode=new TreeNode(nums[medium]);
            treeNode.left=sortedArrayToBSTHelp(nums, start, medium-1);
            treeNode.right=sortedArrayToBSTHelp(nums, medium+1, end);
            return treeNode;
        }
    }
}