Topics

153

Data Structure Introduction 1 About DSA 2 What is Data Structure 3 Various Data structures 4 Various Data structures operations 5 Time Complexity 6 Space Complexity 7 Asymptotic Notations — Big O, Omega, Theta 8 What is Algorithm? 9 Algorithm Design Techniques 10 Abstract Data Type (ADT) vs Data Structure 11 Recurrence Relations and the Master Theorem 12 Space-Time Tradeoffs and In-Place Algorithms

Array Data structure 1 Array Introduction in Data Structure 2 Two-dimension Array in Data Structure 3 Multi-dimensional Array 4 Operations on Array 5 Traversal in Array 6 Selection in Array 7 Insertion in Array 8 Deletion in Array 9 Dynamic Arrays and Amortised Resizing 10 Strings as Character Arrays 11 Matrix Traversal Patterns — Row, Column, Diagonal, Spiral 12 Matrix Operations — Transpose, Rotation, Search 13 Two Pointers Technique 14 Sliding Window Technique 15 Prefix Sum and Difference Arrays

Stack Data Structure 1 Stack Data Structure Introduction 2 How Many Ways Can a Stack Be Implemented? 3 Stack operations and Implementation 4 Stack implementation using Linked List 5 Polish Notation 6 Postfix Evaluation Algorithm 7 Infix to Postfix Conversion 8 Infix to Prefix Conversion

Queue Data Structure 1 Queue Introduction 2 How Many Ways Can a Queue Be Implemented? 3 Queue Implementation using Structure 4 Queue Implementation using Array 5 Queue Implementation using Linked List 6 Priority Queue Implementation using Array 7 Queue Implementation using Stack 8 Circular Queue 9 Deque (Double-Ended Queue)

Linked List 1 Linked List Introduction 2 Array and Linked List 3 Singly linked list 4 Doubly linked list 5 Circular linked list 6 Cycle Detection — Floyd's Algorithm

Linked List Program in Java — Step by Step Explanation 1 Implementing a Linked List — Node Class and Setup 2 Implementing Insertion — Head, Tail and Middle 3 Implementing Deletion — By Value and By Position 4 Implementing Traversal 5 Implementing Search 6 Implementing Concatenation of Two Lists 7 Implementing List Splitting 8 Implementing List Reversal — Iterative and Recursive

Recursion 1 Recursion Basics — Base Case and Recursive Case 2 Call Stack and Stack Frames 3 Recursion vs Iteration 4 Tail Recursion and Common Pitfalls

Hashing and Hash Tables 1 Introduction to Hashing 2 Hash Functions and Properties 3 Collision Resolution — Chaining 4 Collision Resolution — Open Addressing 5 Load Factor and Rehashing 6 Applications of Hashing

Dictionary in Data Structure 1 Dictionary in Data Structure 2 Dictionary Operations and Complexity

Map in Data Structure 1 Map in Data Structure 2 HashMap vs TreeMap vs LinkedHashMap 3 Set in Data Structure

Searching 1 Linear Search 2 Binary Search 3 Binary Search on Answer / Search Space 4 Interpolation and Exponential Search 5 Comparison of Searching Techniques 6 Ternary Search and Searching in Rotated Arrays

Tree 1 Tree Introduction 2 Types of tree 3 Binary Tree 4 Complete Binary Tree 5 level and height of the tree 6 Skewed Binary Tree 7 Extended Binary Tree 8 Tree Traversals — Inorder, Preorder, Postorder 9 Level Order Traversal (BFS on Trees) 10 Binary Search Tree (BST) 11 AVL Tree 12 AVL Rotations — LL, RR, LR, RL 13 B-Tree and B+ Tree 14 Trie (Prefix Tree) 15 Red-Black Tree 16 Lowest Common Ancestor and Tree Diameter

Heap and Priority Queue 1 Heap Introduction — Min Heap and Max Heap 2 Array Representation of a Heap 3 Heap Operations — Insert, Delete, Heapify 4 Building a Heap and Priority Queue Implementation

Graph in Data Structure 1 Graph in Data Structure 2 Representation of Graphs 3 Graph Terminology 4 Breadth-First Search (BFS) 5 Depth-First Search (DFS) 6 Topological Sorting 7 Minimum Spanning Tree — Prim's and Kruskal's 8 Shortest Path — Dijkstra's Algorithm 9 Cycle Detection in Graphs 10 Shortest Path — Bellman-Ford Algorithm 11 All-Pairs Shortest Path — Floyd-Warshall 12 Strongly Connected Components — Kosaraju and Tarjan

Sorting in Data Structure 1 Selection Sort 2 Merge Sort 3 Quick Sort 4 Insertion Sort 5 Bubble Sort 6 Heap sort 7 Bucket sort 8 Counting Sort and Radix Sort 9 Stability in Sorting Algorithms 10 Comparison of Sorting Algorithms 11 Shell Sort and Hybrid Sorts (Timsort, Introsort) 12 External Sorting for Large Datasets

Algorithmic Paradigms 1 Divide and Conquer - Algorithmic Paradigms 2 Greedy Algorithms - Algorithmic Paradigms 3 Dynamic Programming — Memoisation and Tabulation 4 Backtracking 5 Classic DP Problems — Knapsack, LCS, Edit Distance 6 Branch and Bound 7 Randomised Algorithms

Disjoint Set (Union-Find) 1 Disjoint Set Introduction 2 Union by Rank and Union by Size 3 Path Compression 4 Applications — Kruskal's MST and Connectivity

String Algorithms 1 String Matching — Naive Approach 2 KMP Algorithm and the LPS Array 3 Rabin-Karp Rolling Hash 4 Z-Algorithm and Pattern Preprocessing 5 Palindromes, Anagrams and Common String Problems 6 String Compression and Run-Length Encoding

Advanced Tree Structures 1 Segment Tree — Build, Query, Update 2 Lazy Propagation in Segment Trees 3 Fenwick Tree (Binary Indexed Tree) 4 Suffix Tree and Suffix Array

Bit Manipulation 1 Bitwise Operators and Binary Representation 2 Common Bit Tricks and XOR Properties 3 Bit Masking and Subset Generation

Applying Data Structures in the Real World 1 Choosing the Right Data Structure — A Decision Guide 2 Case Study — LRU Cache (Hash Map + Doubly Linked List) 3 Case Study — Autocomplete with a Trie 4 Case Study — Huffman Coding with a Min Heap 5 Iterators and Traversal Patterns 6 Choosing Structures Under Memory Constraints

No topics found for your search.

Table of Contents

Case Study — Huffman Coding with a Min Heap

Rumman Ansari September 27, 2026 12 views Subject Details

🔒 Please log in to unlock this course.