static void findSwapped(Node n, Node result[]) {
		if (n == null) {
			return;
		}
		findSwapped(n.left, result);
		findSwapped(n.right, result);

		// if n is not a bst and one of it's child is not a bst then n is the
		// parent of problem
		if ((n.left != null && !n.left.isBST())
				|| (n.right != null && !n.right.isBST())) {
			result[result[0] == null ? 0 : 1] = n;
		}
	}