Search⌘ K

Deletion in a Singly Linked List

Explore how to efficiently delete the first node in a singly linked list using C#. This lesson covers the theory and implementation of head deletion, highlighting its O(1) time complexity and memory management via .Net garbage collection.

Introduction

The deletion operation combines principles from both insertion and search. It uses the search functionality to find the value in the list.

Deletion is one of the instances where linked lists are more efficient than arrays. In an array, you have to shift all the elements backward if one element is deleted. Even then, the ...