Classification of Data Structure

      If the data contains a single value this can be organized using primitive data type. If the data contains set of values they can be represented using non-primitive data types.

      Data structures can be classified into two types

  • Linear data structures
  • Non-linear data structures


In linear data structure the elements are stored in sequential order. The linear data structures are

Array: Array is a collection of data of same data type stored in consecutive memory location and is referred by common name

Linked list: Linked list is a collection of data of same data type but the data items need not be stored in consecutive memory locations.

Stack: A stack is a Last-In-First-Out linear data structure in which insertion and deletion takes place at only one end called the top of the stack.

Queue: A Queue is a First in First-Out Linear data structure in which insertions takes place one end called the rear and the deletions takes place at one end called the Front.


Elements are stored based on the hierarchical relationship among the data. The following are some of the Non-Linear data structure 

Trees: Trees are used to represent data that has some hierarchical relationship among the data elements.


Graph: Graph is used to represent data that has relationship between pair of elements not necessarily hierarchical in nature. For example electrical and communication networks, airline routes, flow chart, graphs for planning projects.


Data Structures Examples - Video:


From the Web

Suggestions: (1)

See few results | more results

Search: [Press Enter]

Share |