Data Structures and Algorithms

1. Array methods (Introduction)

   • Menu Driven Program

   • Reverse number

   • Delete Specific Data

2. Stack

   • Stack implementation

   • Infix to Prefix Expression

   • Infix to Postfix Expression

   • Prefix evaluation

   • Postfix evaluation

3. Queue

   • Linear Queue

   • Circular Queue

   • Priority Queue

4. Recursion

   • Factorial using Recursion

   • Fibonacci using Recursion

   • G.C.D using Recursion

   • Tower of Hanoi using Recursion

5. Linked List

   • Singular Linked List

   • Circular Linked List

   • Doubly Linked List

   • Doubly Circular Linked List

   • Implementation of Stack and Queue using Linked List

     • Stack implementation using Linked List

     • Queue implementation using Linked List

6. Sorting

   • Bubble Sort

   • Selection Sort

   • Insertion Sort

   • Shell Sort

   • Quick Sort

   • Merge Sort

   • Heap Sort

7. Searching and Hashing

   • Linear Search

   • Binary Search

   • Hashing

8. Trees and Graphs

   • AVL Tree

   • Binary Search Tree

   • Kruskal's Algorithm

   • Prim's Algorithm

   • Dijkstra's Algorithm

   • Binary Tree

   • Breadth First Search

   • Depth First Search

   • Huffman Coding