linked list

Linked Lists
A linked list, in its simplest form, is a collection of nodes that together form a linear ordering.
Linked Lists are a very common way of storing arrays of data. The major benefit of linked lists is
that you do not specify a fixed size for your list. The more elements you add to the chain, the
bigger the chain gets.
There is more than one type of a linked list, we ll stick to singly linked lists (the simplest one).
If for example you want a doubly linked list instead, very few simple modifications will give
you what you re looking for. Many data structures (e.g. Stacks, Queues, Binary Trees) are often
implemented using the concept of linked lists. Some different types of linked lists are shown
below:
A few basic types of Linked Lists
Singly Linked List
Root node links one way through all the nodes. Last node links to null.
Circular Linked List
Circular linked lists have a reference to one node which is the tail node and all the nodes are
linked together in one direction forming a circle. The benefit of using circular lists is that
appending to the end can be done very guickly.