- Linear data structures:- in which insertion and deletion is possible in linear fashion .example:- arrays, linked lists.
- Non linear data structures:-in which it is not possible. example:- trees ,stacks
A data structure is classified into two categories: Linear and Non-Linear data structures. A data structure is said to be linear if the elements form a sequence, for example Array, Linked list, queue etc. Elements in a nonlinear data structure do not form a sequence, for example Tree, Hash tree, Binary tree, etc. There are two ways of representing linear data structures in memory. One way is to have the linear relationship between the elements by means of sequential memory locations. Such linear structures are called arrays. The other way is to have the linear relationship between the elements represented by means of links. Such linear data structures are called linked list
Linear data structures
| General type | Specific types | List (or vector or sequence) | Array, Bitmaps, Images, Heightfields, Dynamic array, Parallel array, Sparse array, Matrix, Sparse matrix, Bitboard, Linked list, Xor linked list, Doubly linked list, VList, Buffer, Stack, Queue, Priority queue, Double-ended priority queue, Deque, Circular buffer, Hash table, Self-balancing binary search tree, Skip list |
