Doubly Linked List: Remove Operations

Some days back, I started reviewing my concepts on Data Structures. Its often said that the best way to learn is to describe your learning to someone else. This article is a continuation of that initiative. It is advisable to have a basic understanding of Singly and Doubly Linked List before reading this article.

This article is all about removing nodes from a Doubly Linked List.

Scenarios:

1. Remove a node from the front of a Doubly Linked List.
2. Remove a node at the end of a Doubly Linked List.

• Remove a node from the front of a Doubly Linked List.

Steps to remove a node from the front of a Doubly Linked List are as:

• Point the Head of the Linked List to the next node of the Head node.
• Assign the Next node of the To-Be removed node to Null.
• Assign the previous node of the new Head node to Null

public void RemoveFirst()
{…