Single Linked List


A linked list is a collection of data structures linked together via links.

A Linked List is a list of items made up of a series of links. Each link is connected to a different link. After an array, the linked list is the most often used data structure. The following are some key terms to know to grasp the notion of Linked List.

  • Link - A linked list's links can store a piece of data known as an element.
  • Next - Each link in a linked list has a Next link that points to the next link.
  • Linked List - A Linked List has the connecting link to the initial link, referred to as First.

Linked List Representation

A linked list is represented as a chain of nodes, each of which points to the next node. The following are some key points to consider.

  • The initial link element in a Linked List is called first.
  • Each link has a data field(s) as well as a next link field.
  • Each link is connected to the next link via the following link.
  • To indicate the conclusion of the list, the last link has a null link.

Basic Operations

The basic operations enabled by a list are as follows.

  • An insertion inserts a new element at the start of the list.
  • Deletion removes an element from the top of the list.
  • The list is displayed in its entirety.
  • Searches for an element using the specified key..
  • Deletes an element with the specified key.