Definition
Linear Data Structure
A data structure is called linear if its elements are arranged sequentially, one after another, forming a chain where each element (except potentially the first and the last) has a defined predecessor and successor.
Examples
Array
Array#definition
Linked List
Definition
Link to originalSingly Linked List
A singly linked list is a linear data structure consisting of node, where each node has the following information:
- value: the actual value represented by the node
- next node: the successor node, which might be null for the tail (last node)
