Explain the data structure that consists of nodes connected by sequential links

A data structure consisting of nodes connected by sequential links is called a linked list. Each node contains data and a reference (or references) to the next (and sometimes previous) node.

Example of a singly linked list:

• Node 1 → Node 2 → Node 3 → null

Linked lists are convenient for dynamic addition and removal of elements, as they do not require shifting elements, unlike arrays.