lintcode,把排序数组转换为高度最小的二叉搜索树

给一个排序数组（从小到大），将其转换为一棵高度最小的排序二叉树。
样例
给出数组 [1,2,3,4,5,6,7], 返回

4
/ \
2 6
/ \ / \
1 3 5 7

解题思路：递归实现
一刷ac

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */ 
public class Solution {
    /**
     * @param A: an integer array
     * @return: a tree node
     */
    public TreeNode sortedArrayToBST(int[] A) { 
        if(A == null || A.length == 0) return null;
        TreeNode root = null;
        root = recursion(A, 1, A.length, root);
        return root;

    }
    public TreeNode recursion(int[] A, int left, int right, TreeNode node){
        if(left <= right){
            int mid = (left + right)/2;
            node = new TreeNode(A[mid-1]);
            node.left = recursion(A, left, mid-1, node.left);
            node.right = recursion(A, mid+1, right, node.right);
        }
        return node;
    }
}