Chapter-1 Introduction to Data Structure (Hindi)

Chapter-2 Analysis of Algorithm in DS (Hindi)

Chapter-3 Arrays in Data Structure (Hindi)
Chapter-4 Recursion and Backtracking in DS Part 1 (Hindi)
Chapter-4 Recursion and Backtracking Part 2 (Hindi)
Chapter-5 Program of Tower of Hanoi (Hindi)
Chapter-5 Program of factorial with recursion (Hindi)
Chapter-5 Program of Fibonacci Series with recursion (Hindi)
Chapter-5 Program of Greatest Common Divisor with Recursion
(Hindi)
Chapter-6 Program of Linked List Part-1 (Hindi)
Chapter-6 Program of Linked List Part-2 (Hindi)
Chapter-6 Program of Linked List Part-3 (Hindi)
Chapter-7 Doubly Linked List Part 1 (Hindi)
Chapter-8 Stack in Data Structure Part 1 (Hindi)
Chapter-8 Stack in Data Structure Part 2 (Hindi)
Chapter-9 Polish Notation in Data Structure (Hindi)
Chapter-10 Infix to Postfix Algorithm (Hindi)
Chapter-11 Evaluation of Postfix Expression (Hindi)
Chapter-12 Queue in Data Structure (Hindi)
Chapter-13 Array Implementation of Queue (Hindi)
Chapter-14 Introduction to Tree in Data Structure (Hindi)
Chapter-15 Binary Tree in Data Structure (Hindi)
Chapter-16 Representation of Binary Tree in Data Structure (Hindi)
Chapter-17 Preorder Traversal of Binary Tree with Recursion (Hindi)
Chapter-18 Inorder Traversal of Binary Tree with Recursion (Hindi)
Chapter-19 Postorder Traversal of Binary Tree with Recursion (Hindi)
Chapter-20 Level Order Traversal of Binary Tree (Hindi)
Chapter-21 Binary Search Tree (Hindi)
Chapter-22 Find element in Binary Search Tree with Recursion (Hindi)
Chapter-23 Insert an element in Binary Search Tree (Hindi)
Chapter-24 Deletion in Binary Search Tree (Hindi)
Chapter-25 AVL Tree (Hindi)
Chapter-26 Rotations in AVL Tree (Hindi)
Chapter-27 Solved Example of Rotations in AVL Tree (Hindi)
Chapter-28 What is Heap? (Hindi)
Chapter-29 Insertion and Deletion in Heap (Hindi)
Chapter-30 Threaded Binary Tree (Hindi)
Chapter-31 M way Search Tree (Hindi)
Chapter-32 B Tree (Hindi)
Chapter-33 Linear Search in Data Structure (Hindi)
Chapter-34 Binary Search in Data Structure (Hindi)
Chapter-35 What is Hashing in Data Structure (Hindi)
Chapter-36 Hash Functions in Data Structure (Hindi)
Chapter-37 Collision resolution in Hashing in Data Structure (Hindi)
Chapter-40 Bubble Sort Algorithm and Program (Hindi)
Chapter-41 Modified Bubble Sort Algorithm and Program (Hindi)
Chapter 42 Selection Sort Algorithm and Program Hindi
Chapter-43 Insertion Sort Algorithm and Program (Hindi)

Chapter-44 Quick Sort Algorithm and Program (Hindi)

Chapter-45 Heap Sort Algorithm and Program (Hindi)
Chapter-46 Merge sort Logic explained in Data Structure (Hindi)
Chapter-47 Merge Sort Program Explained in Data Structure (Hindi)
Chapter-48 Counting Sort in Data Structure (Hindi)
Chapter-51 Introduction to Graphs in Data Structure (Hindi)
Chapter-52 Representation of Graph in Data Structure (hindi)
Chapter-53 Adjacency List Representation of Graph in Data Structure
(Hindi)
Chapter-54 Floyd Warshall algorithm for all pair shortest path in Data
structure (Hindi)
Chapter-55 Breadth First Search in Data Structure (Hindi)
Chapter-56 Depth First Search in Data Structure(Hindi)
Chapter-57 Minimal Spanning Tree in Data Structure (Hindi))
Chapter-58 Kruskal’s Algorithm Explained in Data Structure (Hindi)
Chapter-59 Prim’s Algorithm in Data Structure (Hindi)
Chapter-60 Dijkstra’s Algorithm in Data structure (Hindi)
Programs on data structure
How to reverse a linked list in C
Program of circular linked list Part-1
Program of circular linked list in C Part-2
Program of Circular linked list in C Part-3
Program of Circular linked list in C Part-4
Program of circular linked list in C Part 5 (Hindi)
Program of circular linked list in C Part-6
Program of Circular linked list in C Part-7
Program of circular linked list in C Part-8 (Hindi)
 Arrays
 Implement Array ADT (Abstract Data Type) Part-1
 Implement Array ADT (Abstract Data Type) Part-2
 Implement Array ADT (Abstract Data Type) Part-3
 Implement Array ADT (Abstract Data Type) Part-4
 Implement Array ADT (Abstract Data Type) Part-5
 Implement Array ADT (Abstract Data Type) Part-6
 CPP program to implement ArrayADT part-1
 CPP program to implement ArrayADT part-2
 CPP program to implement ArrayADT part-3
 CPP Program to implement ArrayADT part 4
Recursion
 Program to calculate Sum of first N natural numbers using recursion (Hindi)
 Sum of squares of first N natural numbers using recursion
 Program to calculate sum of cubes of first N natural numbers
 Program to calculate sum of first N odd natural numbers
 Program to calculate sum of first N even natural numbers
 Print binary of a decimal number using recursion in C
 Program of factorial with recursion (Hindi)
 Program of Fibonacci Series with recursion (Hindi)
 Program of Tower of Hanoi (Hindi)
 Program of Greatest Common Divisor with Recursion (Hindi)
Singly Linked List
 Chapter-6 Program of Linked List Part-1 (Hindi)
 Chapter-6 Program of Linked List Part-2 (Hindi)
 Chapter-6 Program of Linked List Part-3 (Hindi)
 How to reverse a linked list in C
 CPP Program to implement LinkedListADT part-1
 CPP Program to implement LinkedListADT part-2
 CPP Program to implement LinkedListADT part-3
 CPP Program to implement LinkedListADT part-4
 CPP Program to implement LinkedListADT part-5
 #1 Linked List Program in Java | Hindi
 #2 Linked List Program in Java | Hindi
 #3 Linked List Program in Java | Hindi
 #4 Linked List Program In Java | Hindi
 #5 Linked List program in Java | Hindi
 #6 Linked List Program in Java | Hindi
 #7 Linked List Program in Java | Hindi
Doubly Linked List
 Introduction to Doubly Linked List program in C language
 Insertion as a first node in doubly linked list program in C language
 Insertion as a last node in doubly linked list program in C language
 Insertion after a node in Doubly Linked List in C Language
 Search in Doubly Linked List in C Language
 Deletion of first node in doubly linked list in C language
 Deletion of last node in doubly linked list in C language
 Deletion of an intermediate node in doubly linked list in C language
 Driver program in C to test doubly linked list code
Circular Linked List
 Program of circular linked list Part-1
 Program of circular linked list in C Part-2
 Program of Circular linked list in C Part-3
 Program of Circular linked list in C Part-4
 Program of circular linked list in C Part 5 (Hindi)
 Program of circular linked list in C Part-6
 Program of Circular linked list in C Part-7
 Program of circular linked list in C Part-8 (Hindi)
Stack
 Stack implementation using linked list in C language part 1 of 4
 Stack implementation using linked list in C language Part 2 of 4
 Stack implementation using linked list in C language Part 3 of 4
 Stack implementation using linked list in C language Part 4 of 4
 CPP Program to implement Two Way Stack part-1 of 2
 CPP Program to implement Two Way Stack part-2 of 2
Queue
 C++ Program of Queue using linked list part 1 of 3
 C++ Program of Queue using linked list part 2 of 3
 C++ Program of Queue using linked list part 3 of 3
 Introduction: Implementation of Queue using dynamic arrays in C language
part 1 of 11
 createQueue: Implementation of Queue using dynamic arrays in C language
part 2 of 11
 isEmptyQueue: Implementation of Queue using dynamic arrays in C
language part 3 of 11
 isFullQueue: Implementation of Queue using dynamic arrays in C language
part 4 of 11
 queueCapacity: Implementation of Queue using dynamic arrays in C
language part 5 of 11
 doubleQueue: Implementation of Queue using dynamic arrays in C language
part 6 of 11
 halfQueue: Implementation of Queue using dynamic arrays in C language
part 7 of 11
 enQueue: Implementation of Queue using dynamic arrays in C language part
8 of 11
 deQueue: Implementation of Queue using dynamic arrays in C language part
9 of 11
 deleteQueue: Implementation of Queue using dynamic arrays in C language
part 10 of 11
 main: Implementation of Queue using dynamic arrays part 11 of 11