public void addAll(SingleLinkedList<E> list) {
		Node current = firstNode;
		Node insert = list.firstNode;

		if (insert.data.compareTo(current.data) < 0) {
			Node temp = new Node(insert.data, insert.next);
			temp.next = this.firstNode;
			firstNode = temp;
			current = firstNode;
			insert = insert.next;
			numberOfEntries++;
		}
		while (insert != null && current.next != null) {
			if (insert.data.compareTo(current.next.data) < 0) {
				Node temp = new Node(insert.data, insert.next);
				temp.next = current.next;
				current.next = temp;
				insert = insert.next;
				current = current.next;
				numberOfEntries++;
			} else {
				current = current.next;
			}
		}
		while (insert != null) {
			current.next = new Node(insert.data, null);
			numberOfEntries++;
			current = current.next;
			insert = insert.next;
		}
	}