CTCI 4.3

Given a sorted(increasing order) array, write an algorithm to create a binary search tree with minimal height.

CTCI 4.3.java

public static Node creatBST(int[] array){
    return division(array, 0, array.length - 1);    
}

public static Node division(int[] array, int begin, int end){
    if(begin < end) return null;
    
    int mid = (begin + end) / 2;
    Node thisNode = new Node(array[mid]);
    thisNode.left = division(array, begin, mid - 1);
    thisNode.right = division(array, mid + 1, end);
    
    return thisNode;
    
}