In the Topic Data Structure and Types, DATA STRUCTURE is a collection of data elements whose organization is characterized by assessing operations that are used to store and retrieve the individual data elements; the implementation of the composite data members in an abstract data type. An abstract data type can be defines as a data type whose properties are specified independently of any particular implementation.
In the linear Data Structures processing of data items is possible in linear fashion, i.e., data can be processed one by one sequentially. Linear data structures contain following types of data structures.
A Data Structures in which insertion and deletion is not possible in a linear fashion is called nonlinear DATA STRUCTURE. In this category of DATA STRUCTURE, we will discuss the following.
This is the data type that typically is directly operated upon by machine-level instructions. We will present storage representations for these data structures (types) for a variety of machines. For example, declaration of variables with basic datatypes is the example of primitive data structure.
Non-primitive data types can be classified as arrays, lists and files. As array is an ordered set which consists of a fixed number of objects. No deletion or insertion operations are performed on arrays. A list, on the other hand, is an ordered set consisting of a variable number of elements to which insertions and deletions can be made.