Data Structure Tutorial

This section contains the data structure tutorial with the most common and most popular topics like Linked List, Stack, Queue, Tree, Graph etc.

Data structure is logical or mathematical organization of data; it describes how to store the data and access data from memory. Actually in our programming data stored in main memory(RAM) and To develop efficient software or firmware we need to care about memory. To efficiently manage we required data structure.

There are two different types of data structure:

  1. Linear Data Structure: In linear data structure data elements stored in sequential manner. Stack, Queue and Linked List are the types of linear data structure.
  2. Non Linear Data Structure: In Non-Linear data structure data elements are not stored in the sequence manner. Tree and Graph are the type of non-linear data structure.

Topics of Data Structure

List of Data Structure Tutorial topics...


  1. Introduction to Trees and its terminologies.
  2. Binary tree, Definition and its properties.
  3. Binary Tree representation (Sequential and Link).
  4. Traversal technique for Binary Tree.
  5. Insertion in Binary Search Tree (BST).
  6. Deletion in Binary Search Tree (BST).
  7. Find Height (Maximum Depth) of a Binary Search Tree (C++ program).
  8. Find the Number of Nodes in a Binary Search Tree (C++ program).
  9. Find the number of leaf nodes in a Binary Tree | Data Structure.
  10. Find whether two trees are structurally identical or not | Data Structure.
  11. AVL Tree, Left and right rotations.
  12. Introduction to B Tree and its operations
  13. Red Black Tree (Properties, Advantages, Inserting Nodes).
  14. Interval Tree in Data Structure.
  15. Threaded Binary Tree | Data Structure.
  16. Level Order Traversal on a Binary Tree | Data Structure.
  17. Segment Trees
  18. Construct a Binary Tree from Postorder and Inorder Traversal


  1. Introduction to Graph in Data Structure
  2. Representation of a Graph in Data Structure
  3. Breath First Search (BFS) of a Graph
  4. Depth First Search (DFS) of a Graph
  5. Cycle Detection in an Undirected Graph
  6. Cycle Detection in a Directed Graph
  7. Prim's Minimum Spanning Tree
  8. Count all the possible path between two vertices


  1. Heap Sort (Introduction, Algorithm and Program using C).

Competitive Questions

  1. Aggressive Cows (On Binary Search)
  2. Find Maximum Range of Query using Segment Trees


  1. Augmenting Data Structure.
  2. Tail Recursion and Tower of Hanoi using C.
  3. Asymptotic Notations.
  4. Hashing (Hash table, Hash functions and its characteristics).
  5. Hamiltonian Cycle in Data Structure.

Comments and Discussions

Ad: Are you a blogger? Join our Blogging forum.

Languages: » C » C++ » C++ STL » Java » Data Structure » C#.Net » Android » Kotlin » SQL
Web Technologies: » PHP » Python » JavaScript » CSS » Ajax » Node.js » Web programming/HTML
Solved programs: » C » C++ » DS » Java » C#
Aptitude que. & ans.: » C » C++ » Java » DBMS
Interview que. & ans.: » C » Embedded C » Java » SEO » HR
CS Subjects: » CS Basics » O.S. » Networks » DBMS » Embedded Systems » Cloud Computing
» Machine learning » CS Organizations » Linux » DOS
More: » Articles » Puzzles » News/Updates

© https://www.includehelp.com some rights reserved.