01. Introduction to LinkedLists

What is a Linked List?

A linked list is a data structure that consists of a group of nodes that together represent a sequence.

Each node is composed of a generic data element and a reference to the next node in the sequence.

Comparison to Arrays

  • Arrays can be traversed randomly, while linked lists must be traversed sequentially.
  • Linked list can grow dynamically, while arrays must define a size before its instantiation.
  • Because arrays have fixed sizes, we must know the upper limit of the number of elements in advance.
  • Memory allocation for an array is compile time and linked list is run time.
  • Inserting elements into an array is expensive since we have to shift all elements coming after the insertion node over one. For linked lists, however, you can simply insert a node by reconfiguring the node coming before it.
  • Linked lists allow for dynamic resizing, making it easy to add more data.

Types of Linked Lists

There are several types of linked lists, but we'll begin by looking at the simplest - the singly-linked list.

A singly-linked list has only a NEXT pointer, which points to the next node in sequence. A doubly-linked list would have an additional PREV pointer that points to the previous node.

There is also a circular linked list, in which one next NEXT pointer points to a previous element.

A linked list made up of nodes.

The linking of a group of NODE objects is what gives us a linked list. Each NEXT pointer connects one node to the next. If the node is at the end, its NEXT pointer will point to NULL.

Head and Tail

Additionally, there are two more pointers in a linked list. The HEAD of the linked list holds the first node in the list, while the TAIL holds the last.


Space O(n) O(n)
Lookup O(n) O(n)
Insert O(n) O(n)
Delete O(n) O(n)

Ace your Technical Interview


Ace your Technical Interview Try Algorithms

This fourth edition of Algorithms is the leading textbook on algorithms today and is widely used in universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing.

$ Check price
89.9989.99Amazon 4.5 logo(148+ reviews)

More Algorithms resources

Aching back from coding all day?

Inversion Therapy Table

Aching back from coding all day? Try Back Problems

Stretch out your back and relieve your back muscles with inversion therapy. This device counteracts the forces of gravity on the body by decompressing and elongating the spine. By using this product just ten minutes a day, you can be well on your way to improved circulation and posture while relieving muscle aches, back pain and stress.

$$ Check price
119.98119.98Amazon 4.5 logo(1,700+ reviews)

More Back Problems resources