INTRODUCTION TO DATA STRUCTURE
A data structure is a way of storing the data in computer’s memory so that it can be used efficiently. Formally, a data structure is a logical or mathematical model of organization of data. The choice of data structure begins with the choice of an Abstract Data Type (ADT) such as array.
CLASSIFICATION OF DATA STRUCTURES
It can be classified into three different categories:
1. Linear and Non-linear data structures
2. Static and Dynamic Data structures
3. Homogeneous and Non-homogeneous data structuresNow we will explain above categories one by one.1. Linear and Non-linear data structures
Linear data structure are those in which elements in a linear manner or in a linear sequence.
Example: Array, Linked List, Queue , stack etc.
Non-linear data structures are those in which elements do not have any sequence.
Example: Trees , Graph etc.
A data structure is a way of storing the data in computer’s memory so that it can be used efficiently. Formally, a data structure is a logical or mathematical model of organization of data. The choice of data structure begins with the choice of an Abstract Data Type (ADT) such as array.
CLASSIFICATION OF DATA STRUCTURES
It can be classified into three different categories:
1. Linear and Non-linear data structures
2. Static and Dynamic Data structures
3. Homogeneous and Non-homogeneous data structuresNow we will explain above categories one by one.1. Linear and Non-linear data structures
Linear data structure are those in which elements in a linear manner or in a linear sequence.
Example: Array, Linked List, Queue , stack etc.
Non-linear data structures are those in which elements do not have any sequence.
Example: Trees , Graph etc.
2. Static and Dynamic Data structures
Static Data structure are those whose memory occupation is fixed. The memory taken by these Data structures cannot be increased or decreased at run time.
Example: Array.
The size of an array is declared at compile time and this size cannot be changed during the run time.
Dynamic Data structures are those whose memory occupation is not fixed. The memory taken by these Data structures can be increased or decreased at run time.
Example: Link list.
The size of an Link list is declared at compile time and this size cannot be changed during the run time.
Note: Data structures like stack , queue , tree and graph can be static or dynamic depending on, whether these are implemented using an array or a link list.
3. Homogeneous and Non-homogeneous data structures
3. Homogeneous and Non-homogeneous data structures
Homogeneous data structure are those in which data of same type can be stored.
Example: Array
Example: Array
Non-Homogeneous data structure are those in which data of different type can be stored.
Example: Link list.
Example: Link list.