Data Structures | Types of Data Structure

Data - Structure -

-> A Data structure is a particular way of organizing data in a computer so that it can be used effectively.
 for example: we can store a list of items having the same data type using the Array data structure.

-> In simple language, Data Structures are structures programmed to store ordered data, so that various operations can be performed on it easily. It represents the knowledge of data to be organized in memory. It should be designed and implemented in such a way that it reduces the complexity and increases the efficiency.


-> Data structures are the building blocks of a program.

-> Data structure mainly specifies the following things:

1. Organization of Data
2. Accessing methods
3. Degree of associativity

4. Processing alternatives for information



Basic Types of Data Structure -

There are two types of data structure:-

1. Primitive data structure (Built-in data structure) -

-> Anything, that can store data can be called as data structure. hence All basic data types of C language like integer, float, char, pointer are known as primitive data structure.

-> Primitive Data Structures are the basic data structures that directly operate upon the machine instructions.


2. Complex data structure (User-defined data structure) -


-> It is based on primitive data structure and it is used to store large and connected data.

-> Non primitive data structure are more complicated data structures.

-> The non-primitive data structures emphasize on structuring of a group of homogeneous (same type) or heterogeneous (different type)data items.


    Some of the complex data structure are:-

1. Arrays
2. Lists
3. Files
4. Stack
5. Queue

   Again list is classified into 2 types:-

1. Linear list -                a)  Stacks                                                                                             b) Queues

2. Non-linear list -           a)  Trees
                                                           b) Graphs