3 Linear type of data structure

 Array -The array is that type of structure that stores homogeneous elements at
memory locations which are contiguous. The same types of objects are stored
sequentially in an array. The main idea of an array is that multiple data of the
same type can be stored together.
 Linked List - he linked list is that type of data structure where separate objects
are stored sequentially. Every object stored in the data structure will have the
data and a reference to the next object.
 Stack - The stack is another type of structure where the elements stored in the
data structure follow the rule of LIFO (last in, first out) or FILO (First In Last Out).

2 Non-Linear type of data structures

 Tree - is a nonlinear data structure, compared to arrays, linked lists, stacks and
queues which are linear data structures. A tree can be empty with no nodes or a
tree is a structure consisting of one node called the root and zero or one or more
subtrees.
 Graph - is a non-linear data structure consisting of nodes and edges. The nodes
are sometimes also referred to as vertices and the edges are lines or arcs that
connect any two nodes in the graph.