Types of Data Structure

In programming, we utilize countless kinds of data structures to give a legitimate construction to our data. A data structure is fundamentally used to gather and put together the data on which we will play out the operations.

Data Structure

Types of Data Structure

Data structures are basically of two broad types:

1. Primitive
2. Non-primitive

Primitive data structures are further classified into the following types:

1. Integer
2. (Double) Floating-point Numbers
3. Character
4. Pointer

Non-Primitive Data Structure

We can classify all non-primitive data structures into the following categories:

• Primitive
  * Integer
  * (Double) Floating-point Numbers
  * Character
  * Pointer
• Non-primitive
  * Linear Data Structure
  Array
  List
  Stack
  Queue
  * Non-Linear Data Structure
  Tree
  Graph
  * File Data Structure

Linear Data Structure:

In the direct data structure, components are put away in a successive way. Legend buster, their name doesn’t that they store components in a direct or contiguous memory location.

Non-Linear Data Structure

In a non-linear data structure, the storage of elements doesn’t follow a sequential order.

File Data Structure

A file is a collection of records. Using a file we can store data in the .txt format. Many programming languages come with a built-in file handling structure.

Conclusion

Data structures are the main piece of a programming language and during tech meets, the most loved subject of the questioner. That is presumably in light of the fact that the capacity to pick the right data structure is one of the indispensable abilities a developer ought to have.