Key Concepts

Review core concepts you need to learn to master this subject

Removing a node from the middle of a linked list

When removing a node from the middle of a linked list, it is necessary to adjust the link on the previous node so that it points to the following node. In the given illustration, the node a1 must point to the node a3 if the node a2 is removed from the linked list.

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