LeetCode 108.Convert Sorted Array to Binary Search Tree

LeetCode 108.Convert Sorted Array to Binary Search Tree

题目来源：https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/

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

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

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