What are the different types of Data Structures?
As we know, the data structure is a way to organize the data in the main memory. So that there exists a logical relationship between individual elements of data.
Now let us study different ways to organize the data structure. Basically, Data is organized in memory in two types:
- Primitive data structure
- Non-primitive data structure
Primitive and Non-Primitive data structures are the two types through which you can understand how data is organized. Firstly we discuss the Primitive Data structure.
Primitive Data structure
Data structures with primitive data types are considered primitive data structures. Primitive Data Structures have predefined data types that directly operate upon machine instructions. It holds a single value in one specific location. Other data types can be created with inbuilt or predefined primitive data types. Int, char, float, double, and pointer are primitive data structures that can hold a single value.
There are certain situations when primitive data structures are not sufficient to perform a particular job. There we need Non-Primitive Data structures also called derived data structures or user-defined data structures.
Non-Primitive Data structure
A data structure that uses a primitive data structure as a base is considered a non-primitive data structure.
A nonprimitive is something you create using primitives. For instance, an array of chars or a class with a bunch of properties and the properties are different. So if you create an array of those classes, it becomes even more complicated (i.e., more non-primitive).
The non-primitive data structure is divided into two types:
- Linear data structure
- Non-linear data structure
Linear Data Structure
The arrangement of data in a sequential manner is known as a linear data structure. The data structures used for this purpose are Arrays, Linked lists, Stacks, and Queues. In these data structures, one element is connected to only one another element in a linear form.
Non-Linear data structure
When one element is connected to the ‘n’ number of elements known as a non-linear data structure, the best example is trees and graphs. In this case, the elements are arranged in a random manner.
Data structures can also be classified as:
Static data structure: It is a type of data structure where the size is allocated at the compile time. Therefore, the maximum size is fixed.
Dynamic data structure: It is a type of data structure where the size is allocated at the run time. Therefore, the maximum size is flexible.
