Ans-: In linear data structures, elements are arranged in linear fashion. The linear ordering is maintained either through consecutive memory locations or by means of pointers. Array, linked list, stack and queue are examples of linear data structures in which values are stored in a sequence.
There are basically two ways of representing such linear structure in memory:
A) One way is to have the linear relationships between the elements represented by means of sequential memory location. These linear structures are called arrays.
B) The other way is to have the linear relationship between the elements represented by means of pointers or links. These linear structures are called linked lists.
Tags
data structure