高度最小的BST

题目描述

import java.util.*;

public class MinimalBST {
public int buildMinimalBST(int[] vals) {
// write code here
if(vals==null||vals.length==0) return 0;
return createTree(vals, 0, vals.length);
}

public int createTree(int[] vals, int start, int end){
if(start > end) return 0;
int mid = (start + end)/2;
int leftDepth = createTree(vals, start, mid-1);
int rightDepth = createTree(vals, mid+1, end);
return Math.max(leftDepth, rightDepth) + 1;
}

}