Introduction to Algorithm Data Structure and Types Operations of Data Structures Performance Analysis of Algorithms Abstract Data Type (ADT) Algorithm Design and Techniques

Recursion in Data Structures Principles of Recursion Types of Recursion Tower of Hanoi (TOH) Using Recursion Fibonacci Series Using Recursion Applications of Recursion

Stack Data Structure Stack Operations Applications of Stack Infix, Prefix and Postfix Conversion in Stack

Queue Data Structure Queue Operations Types of Queues Circular Queue Priority Queue Double-Ended Queue (Deque) Applications of Queue

Linked List Data Structure Operations of Linked List Singly Linked List Doubly Linked List Circular Singly Linked List Circular Doubly Linked List

Tree Data Structure Binary Tree Binary Search Tree AVL Tree (Height Balanced Binary Search Tree) Huffman Coding Algorithm

Sorting in Data Structure Bubble Sort Sequential Search Insertion Sort Selection Sort Quick Sort Merge Sort Shell Sort Binary Sort (Binary Insertion Sort) Efficiency of Sorting and Big O Notation

Searching and Searching Techniques Binary Search Separate Chaining Collision Technique Tree Search Hashing Data Structure Linear Probing Collision Technique Quadratic Probing Collision Technique Double Hashing Collision Resolution Rehashing Collision Resolution Efficiency Comparison of Searching Techniques

Graph Data Structure Types of Graph Graph Representation Methods Graph Traversal Breadth-First Search (BFS) Graph Traversal Depth-First Search (DFS) Spanning Tree and Minimum Spanning Tree Prim's Algorithm - Minimum Spanning Tree Kruskal's Algorithm - Minimum Spanning Tree Dijkstra's Algorithm - Shortest Path Algorithm

Asymptotic Notations Big O, Omega, and Theta