Data Structure can be defined as the way of structuring the data or logical representation between data elements. The Data structure is equal to the Organized data plus the Allowed operations on it.

It is a way of designing and accessing the data elements. In data structure the operations like storage, retrieve and access are performed between the logically related data elements.

The classifications of Data Structure is as :

1. Linear
2. Non-Linear
3. Homogenous
4. Non-Homogenous
5. Dynamic
6. Static

Linear

The linear data structures are arranged in sequential manner, in which on traversing only one data element can be reached. Examples of linear data structure are Linked list, Stack, Queue etc.

Non - Linear

The non linear data structures are not arranged in sequential manner every data element in it are attached to other different data element. Examples of non linear data structure are trees, graphs etc.

Homogeneous

The homogeneous data structures are the one in which the data elements have the same data type. All the data elements in the homogeneous belongs to the single data type. For example: Arrays

Non - Homogeneous

The non-homogeneous data structures are the one in which the data elements doesn't belong to the same data type. All the data elements have different data type. For example: classes, Structure, Union etc

Dynamic

The memory allocation of elements is done before their execution is done. In the data structure before the usage of the element their memory allocation is done with the use of D.M.A function. For example : Linked Lists

Static

The memory allocation of elements in this data structure is done before the program execution. For Example: Arrays.