public Node<Integer> findKthToLastElemItr(Node<Integer> head, int k) {
		Node<Integer> p = head;
		for (int i = 0; i < k - 1; i++) {
			if (p == null)
				return null;
			p = p.next;
		}
		Node<Integer> q = head;
		while (p.next != null) {
			p = p.next;
			q = q.next;
		}
		return q;
	}