Types of Data Structures
A data structure is linear when all the elements are arranged in a
linear order or sequential order. If the elements of a data structure are
arranged to have only one predecessor and one successor, then we
can say that -- that data structures are a linear data structure. We
have a non-linear data structure, we have static data structures and
dynamic data structures. In these type of data structures the memory
is allocated at compile time. The advantage of such data structure is
that we can access data very fast. But on the other hand,
disadvantage is that insertion and deletion operations are slower. We
will discuss this later that how linked list can be created. The linked list
is the best example of a dynamic data structure.
A data structure is linear when all the elements are arranged in a
linear order or sequential order. If the elements of a data structure are
arranged to have only one predecessor and one successor, then we
can say that -- that data structures are a linear data structure. We
have a non-linear data structure, we have static data structures and
dynamic data structures. In these type of data structures the memory
is allocated at compile time. The advantage of such data structure is
that we can access data very fast. But on the other hand,
disadvantage is that insertion and deletion operations are slower. We
will discuss this later that how linked list can be created. The linked list
is the best example of a dynamic data structure.
