Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at a contiguous location; the elements are linked using pointers.

A linked list is represented by a pointer to the first node of the linked list. The first node is called the head. If the linked list is empty, then the value of the head is NULL.
Read more about Linked List here.

Each node in a list consists of at least two parts:
  1. Data.
  2. Pointer (Or Reference) to the next node.

Full implementation with JavaScript 
The Linked List we have created, contains :
Implemented Functions:
  • append()
  • multiAppend()
  • appendAt()
  • prepend()
  • multiPrepend()
  • remove()
  • removeItem()
  • removeLast()
  • get()
  • last()
  • indexOf()
Helper Functions:
  • length()
  • isEmpty()
  • print()
  • clear()

*Examples of each method at the end of the code below.