Linear Data Structure

A Linear Data Structure is a data structure where elements are arranged in a sequence, so each element has one predecessor and one successor (except the first and last).

Examples include an Array, Linked List, Stack and Queue.

In contrast, non-linear data structures like a Binary Tree or a graph can connect an element to several others.