Home Data Structures Data Structures (Introduction)

Data Structures (Introduction)

An Introduction

Data Structure is a data organization, management, and storage format that enables efficient access and modification. Stack, Linked List, Trees, Graphs, etc are examples of basic data structures. Hence at Int Main, we have covered in detail tutorials on different data structures (DS) with topic-wise problems.

This page contains overview tutorials on different data structures (DS) and links.



  1. Array: An array is a collection of items stored at contiguous memory locations.
  2. Linked List:  A linked list is a linear collection of data elements, whose order is not given by their physical placement in memory.
  3. Stack: Stack is a linear data type in which all the operations are performed in the LIFO order.
  4. Queue: Queue is a linear data type in which all the operations are performed in the FIFO order.
  5. Trees: A tree is a non-linear data type that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node
  6. Graph: A Graph is a non-linear abstract data type consisting of vertices and edges. The edges are lines that connect any two vertices in the graph. Two vertices are adjacent if they are connected to each other through an edge.

Books Recommendation

The following are the most popular and recommended books for everyone interested in Data Structures.

  1. Introduction to Algorithms – Thomas H. Cormen (USA, India)
  2. Cracking the Coding Interview – Gayle Laakmann McDowell (USA, India)
  3. Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles 


  1. I would add one more book for DS and Algo, “Data Structures and Algorithms in C++ by Mark Allen Weiss”.


Please enter your comment!
Please enter your name here