Classification of data structure

Data structure are Diveded into two main categories.:~

1. Primitive data structure
2. Non-primitive data structure

1. primitive data structure :~The primitive data structure are defined that can be manipulated or operated by the machine instruction.There is general, have different representations an different computers.

For example- the integers, floating-point numbers, pointers, string constans, characters etc.
are some of the different primitive data structure.in C language, the different primitive data structure are defined using the data type such as int, char, float, double etc.

 2. Non-primitive data structure-The non-primitive data structures are data structure that cannot be manipulated or operated directly by the machine instructions.These are more sophisticated data structures.These are derived from the primitive data structure.
For example-Arrays, structure, stack, queues, linked list etc.
The non-primitive data structure are classified into two categories linear and non linear data structure.Whene the elements are accessed in contiguous memory location then data structure is know as linear   data structure.
Array stack queue and link list are the example of the linear data structure in linear data structure we have to first allocate memory for the number of elements like in arrays.This some time leads to wastage memory.
in non-linear data structure element are not accessed in contigious memory allocation
 Example-Non-linear data structure are tree graph, sets etc.
we can represent a hierarchy of data structure as follows:~