Linear Data Structure
A linear data structure where data element or items arranged one after another or linear sequence and data elements or items can traversed in a single run. Here nodes or data elements we traverse through sequentially. This type of data structure is simpler and easy to implement. Linear data structure use pointer.

Example - Array, Stack, Queue, Linked List.

Advantages
1. Very easy to implement and very easy to understand.
2. Algorithm concept and programming is easy.

Disadvantages
1. Wastage of memory area.
2. Execution time is high.