public int minCostRec(int input[],int freq[]){
        
        return minCostRec(input,freq,0,input.length-1,1);
    }
http://www.geeksforgeeks.org/dynamic-programming-set-24-optimal-binary-search-tree/
src/com/interview/dynamic/OptimalTreeSearch.java