# What Is Example of Linear Data Structure?

//

Larry Thompson

What Is an Example of Linear Data Structure?

A linear data structure is a type of data structure where elements are stored sequentially or linearly. In other words, each element in the structure has a direct predecessor and successor, except for the first and last elements.

## Example 1: Arrays

An array is a common example of a linear data structure. It stores elements in a contiguous block of memory, where each element can be accessed using its index. Elements in an array are ordered and can be traversed sequentially from the first element to the last.

Array elements can be of any data type (e.g., numbers, strings, objects), and they have fixed sizes once declared. Adding or removing elements from an array can be expensive as it may require resizing or shifting existing elements.

A linked list is another example of a linear data structure. Unlike arrays, linked lists consist of nodes that are dynamically allocated in memory and connected through pointers.

In a singly linked list, each node contains both the actual data and a pointer to the next node in the sequence. This allows easy traversal from one node to another by following the pointers.

In a doubly linked list, each node also has a pointer to its previous node, enabling traversal in both directions.

## Example 3: Stacks

A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle. Elements are added and removed from only one end called the top.

The most common operations on stacks include:

• Push: Adds an element to the top of the stack.
• Pop: Removes the top element from the stack.
• Peek: Returns the value of the top element without removing it.

## Example 4: Queues

A queue is a linear data structure that follows the First-In-First-Out (FIFO) principle. Elements are added at one end called the rear and removed from the other end called the front.

The most common operations on queues include:

• Enqueue: Adds an element to the rear of the queue.
• Dequeue: Removes and returns the front element from the queue.
• Peek: Returns the value of the front element without removing it.

### In Conclusion

In this article, we explored several examples of linear data structures, including arrays, linked lists, stacks, and queues. Understanding these structures is crucial for developing efficient algorithms and solving various computer science problems.

To summarize, linear data structures store elements sequentially and have a direct predecessor and successor relationship between elements. They play a vital role in organizing and manipulating data in many applications.