Data Structure Algorithms with C Language
About Lesson

Types of data structures

Based on the organisation of the elements, data structures are divided into two types:

  1. Linear
  2. Non-Linear

 

Liner Data Structures

These data structures which store the data elements in a sequential manner.  Each element would have only one previous element and one next element.

 

Array: It is a sequential arrangement of data elements paired with the index of the data element.

Linked List: Each data element contains a link to another element along with the data present in it.

Stack: It is a data structure which follows only to specific order of operation. LIFO (last in First Out) or FILO(First in Last Out).

Queue: It is similar to Stack but the order of operation is only FIFO (First In First Out).

 

Non-Liner Data Structures

These are the data structures in which there is no sequential linking of data elements.  Any pair or group of data elements can be linked to each other and can be accessed without a strict sequence.  Alternately, we can say there can be many predecessor elements and many successor elements for each element.

Binary Tree: It is a data structure where each data element can be connected to maximum two other data elements and it starts with a root node.

Heap: It is a special case of Tree data structure where the data in the parent node is either strictly greater than/ equal to the child nodes or strictly less than it’s child nodes.

Hash Table: It is a data structure which is made of arrays associated with each other using a hash function. It retrieves values using keys rather than index from a data element.

Graph: It is an arrangement of vertices and nodes where some of the nodes are connected to each other through links.

You cannot copy content of this page