public void removeAll(int length) {
		if (numElements == 0) {
			return;
		}

		SingleNode cursor = head;
		SingleNode temp;

		while (cursor != null && cursor.next != null) {
			temp = cursor.next;
			/* remove nodes until data's length doen't equal length */
			while (temp != null && temp.data.length() == length) {
				cursor.next = temp.next;
				temp = temp.next;
			}

			/* move to next node */
			cursor = cursor.next;
		}

		/* check if the head node should be removed or not */
		if (head.data.length() == length) {
			head = head.next;
		}

	}