public void visit(TreeNode node) {
		if(node.left != null) visit(node.left);
		if(pre != null && node.val < pre.val) {
			if(node1 == null) node1 = pre;
			node2 = node;
		}
		pre = node;
		if(node.right != null) visit(node.right);
	}