C++ Tutorial: Linked Lists Part Two: Append

In computer science, a linked list is a linear collection of data elements, called nodes pointing to the next node by means of pointer.

This data structure serves as a foundation upon which other data structures such as the doubly linked list, circular linked list, stack, queue, priority queue, trees, etc can be built. A thorough understand of the linked list is therefore essential.

In this, part two of this series, we will examine the append algorithm. We take a look at the basic append algorithm:

create a new node
assign data to it
if the list is empty:
place the new node at the beginning of the list
else:
traverse to the end of the list
add the new node to the end of the list
end if

This implies the list is unordered.

In part three of this series, we'll examine an algorithm for inserting nodes into the list, maintaining an ordering of the list.

You can watch the entire series via it's play list here:
youtube.com/playlist?list=PLaatXkJEXKyI5Kyd6NXr…