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...

• Structured Programming, its Advantages and Disadvantages.
• Algorithm and its types.
• Algorithm and its properties.
• Time Space Trade-Off of algorithms.
• Time and Space Analysis of Algorithm.
• Types of Recursion.
• Data Structure types and operations associated with them.
• Introduction of Data Structure.
• Linked List
  • Introduction to Linked List
  • Single Linked list and its basic operations with traversing implementation
  • Single linked list insertion
  • Single linked list deletion
  • Deleting a node from a linked list without head pointer
  • Implement union and intersection of two sorted linked lists
• Stack
  • Stack
  • Implement of stack using array
  • Implementation of Multi Stack in C
  • Nesting of parentheses using stack
  • Check for balanced parentheses by using Stacks (C++ program)
  • Double Stack
  • Implementation of Stack using two Queues
• Queue
  • Linear Queue
  • Circular Queue
  • Double Ended Queue (DeQueue)
  • Priority Queue
  • Implementation of Queue using two Stacks
• Linear, Binary & Interpolation search.

Tree

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

Graph

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

Sorting

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

Data Structure programs using C/C++

1. Quick Sort in C++ with Algorithm, Example.
2. Merge Sort in C++ with Example.
3. Counting Sort with C++ Example.
4. Implement shell sort using C++ program.
5. Dijkstra’s Algorithm: Explanation and Implementation with C++ program.
6. C++ print Postorder traversal from Preorder and Inorder traversal of a tree.
7. Infix To Postfix Conversion Using Stack [with C program].
8. Evaluation of Postfix Expressions Using Stack [with C program].
9. Maximum Sum Helix path (using C++ program).
10. Tower of Hanoi using recursion (C++ program).
11. Find in-order Successor and Predecessor in a BST using C++ program.
12. Implement in-order traversal using C++ program.
13. Implement post-order traversal using C++ program.
14. Implement pre-order traversal using C++ program.
15. Find occurrence of each element in an array using simple method O(n^2) and hashing O(n) time.
16. Check for balanced parentheses by using Stacks (C++ program)

Competitive Questions

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

Misc.

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.

Categories: data structure