找到二叉树中的最大搜索二叉子树

找到二叉树中的最大搜索二叉子树
给定一棵二叉树的头节点head，已知其中所有节点的值都不一样，找到含有节点最多的搜索二叉子树，并返回这棵子树的头节点。

如果节点数为N，要求时间复杂度为 O(N)，额外空间复杂度为O(h)，h 为二叉树的高度

public static class Node{
	public int value;
	public Node left;
	public Node right;
	public Node(int data){
		this.value = data;
	}
}
public static Node biggestSubBST(Node head){
	int[] record = new int[3];	//0->size, 1->min, 2->max
	return posOrder(head, record);
}
public static Node posOrder(Node head, int[] record){
	if(head == null){
		record[0] = 0;
		record[1] = Integer.MAX_VALUE;
		record[2] = Integer.MIN_VALUE;
		return null;
	}
	int value = head.value;
	Node left = head.left;
	Node right = head.right;
	Node lBST = posOrder(left, record);
	int lSize = record[0];
	int lMin = record[1];
	int lMax = record[2];
	Node rBST = posOrder(right, record);
	int rSize = record[0];
	int rMin = record[1];
	int rMax = record[2];
	record[1] = Math.min(lMin, value);
	record[2] = Math.max(rMax, value);
	if(left == lBST && right == rBST && lMax < value && value < rMin){
		record[0] = lSize + rSize + 1;
		return head;
	}
	record[0] = Math.max(lSize, rSize);
	return lSize > rSize ? lBST : rBST;
}