Convert Sorted Array to Binary Search Tree

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

用分治法，二分法来构建。

代码；

public TreeNode sortedArrayToBST(int [] array ) {
        if(array == null) return null;
        return buildTree(array, 0, array.length-1);
    }
    private TreeNode buildTree(int[] array, int low, int high){
        if(low<=high){
            int mid = low + (high - low )/2;
            TreeNode node = new TreeNode(array[mid]);
            node.left = buildTree(array, low, mid-1);
            node.right = buildTree(array, mid+1, high);
            return node;
        }
        return null;
    }