Linear Data Structures

Linear Data Structures: The data structure where data items are organized sequentially or linearly where data elements attached one after another is called linear data structure. Data elements in a liner data structure are traversed one after the other and only one element can be directly reached while traversing. All the data items in linear data structure can be traversed in single run.

These kind of data structures are very easy to implement because memory of computer is also organized in linear fashion.

Examples of linear data structures are Arrays, Stack, Queue and Linked List.

An arrays is a collection of data items having the same data types. A Stack is a LIFO (Last In First Out) data structure where element that added last will be deleted first. All operations on stack are performed from on end called TOP. A Queue is a FIFO (First In First Out) data structure where element that added first will be deleted first. In queue, insertion is performed from one end called REAR and deletion is performed from another end called FRONT. A Linked list is a collection of nodes, where each node is made up of a data element and a reference to the next node in the sequence.

<< Prev – Data Structures
Next – Arrays >>