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

createMinimalBST

var createMinimalBST = function(array){
    var makeNode = function(value){
        var obj = {
            value:value,
            left:null,
            right:null
        };
        return obj;
    };
    
    addToTree = function(array, start, end){
        if (end < start){
            return null;
        }
        var median = Math.floor( (start + end) / 2);
        var currentNode = makeNode(array[median]);
        currentNode.left = addToTree(array, start, median-1);
        currentNode.right = addToTree(array, median+1, end);
        return currentNode;
    };
    
    return addToTree(array, 0, array.length-1);
};

// console.log(createMinimalBST([1,2,3,4,5,6,7,8,9,10]));