Key Concepts

Review core concepts you need to learn to master this subject

Linked List data structure

A linked list is a linear data structure where elements are not stored at contiguous location. Instead the elements are linked using pointers.

In a linked list data is stored in nodes and each node is linked to the next and, optionally, to the previous. Each node in a list consists of the following parts:

1) data 2) A pointer (Or reference) to the next node 3) Optionally, a pointer to the previous node

Linked Lists: Conceptual
Lesson 1 of 2
  1. 1
    Linked lists are one of the basic data structures used in computer science. They have many direct applications and serve as the foundation for more complex data structures. The list is comprised …
  2. 2
    As an example, we added values to the linked list diagram from the introduction. This linked list contains three nodes (node_a, node_b, and node_c). Each node in this particular list contains a…
  3. 3
    With linked lists, because nodes are linked to from only one other node, you can’t just go adding and removing nodes willy-nilly without doing a bit of maintenance. #### Adding a new node Adding …
  4. 4
    Let’s take a minute to review what we’ve covered about linked lists in this lesson. Linked Lists: - Are comprised of nodes - The nodes contain a link to the next node (and also the previous node …

How you'll master it

Stress-test your knowledge with quizzes that help commit syntax to memory

Pro Logo