DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
Master Minimum Spanning Tree concepts completely — what an MST is, the cut property and cycle property proofs, why MSTs are optimal, the two fundamental MST algorithms (Kruskal
What Is a Spanning Tree?
A spanning tree of a connected undirected graph G = (V, E) is a subgraph T = (V, E') that:
- Contains all vertices of G
- Is a tree (connected, no cycles)
- Has exactly V-1 edges
A spanning tree spans (covers) all vertices while using the minimum possible edges.
Example
Graph: One Spanning Tree:
A—5—B A B
| | → | |
3 2 3 2
| | | |
D—1—C D C
(removed edge A-B and D-C to make tree)
MST Properties
Property 1: Cut Property
A cut is a partition of vertices into two non-empty groups S and V-S. Crossing edges cross between S and V-S.
Cut Property: For any cut (S, V-S), the minimum-weight crossing edge belongs to some MST.
Example
Proof (by contradiction):
Suppose e = (u,v) is the minimum crossing edge but not in any MST T.
Adding e to T creates a cycle (T was a tree).
This cycle must contain another crossing edge e' (to connect S and V-S).
Replace e' with e: weight(e) < weight(e') → smaller tree → T was not MST!
Contradiction. So e must be in some MST. ✓
This property is the foundation of both Kruskal's and Prim's algorithms.
Property 2: Cycle Property
For any cycle in G, the maximum-weight edge in the cycle does NOT belong to any MST (if all edge weights are distinct).
Intuition: If we have a cycle, we can always remove the heaviest edge without disconnecting the graph, reducing total weight. So the heaviest cycle edge is never in the MST.
MST Algorithms Summary
| Algorithm | Strategy | Time | Best For |
|---|---|---|---|
| Kruskal's | Add cheapest edge not forming cycle | O(E log E) | Sparse graphs |
| Prim's | Add cheapest edge extending MST | O(E log V) | Dense graphs |
| Borůvka's | Each component adds cheapest outgoing edge | O(E log V) | Parallel computation |
Building MSTs — Quick Preview
Kruskal's (Sort + DSU)
| Sort all edges by weight | [(1,D-C),(2,A-D),(3,B-C),(4,A-B)] |
| Add D-C (weight 1) | {D-C} |
| Add A-D (weight 2) | {D-C, A-D} |
| Add B-C (weight 3) | {D-C, A-D, B-C} |
| Skip A-B (weight 4) | would create cycle A-D-C-B-A |
| MST | {D-C, A-D, B-C}, total weight = 6 ✓ |
Prim's (Priority Queue)
| Start with A | candidates = {A-D:2, A-B:4} |
| Add cheapest (A-D | 2): MST = {A-D}, candidates = {A-B:4, D-C:1} |
| Add cheapest (D-C | 1): MST = {A-D, D-C}, candidates = {A-B:4, C-B:3} |
| Add cheapest (C-B | 3): MST = {A-D, D-C, C-B} |
Real-World Applications
1. Network Design (Minimum Cost)
Example
Problem: Connect 5 offices with fiber optic cables.
Each potential cable has a cost.
Find minimum total cost to connect all offices.
Solution: MST of the network graph!
Vertices = offices
Edges = possible connections
Weights = cable costs
MST = minimum-cost connected network
2. Cluster Analysis
Example
Hierarchical clustering: Build MST of data points
(edge weight = distance between points).
Remove the k-1 heaviest edges → k clusters.
Alternative to k-means for non-spherical clusters.
3. Approximation Algorithms
Example
Traveling Salesman Problem (TSP) approximation:
1. Find MST (weight = OPT/2 at minimum)
2. Double all edges
3. Find Eulerian circuit
4. Shortcut repeated vertices
Result: ≤ 2 × optimal TSP tour
This gives a 2-approximation for TSP in polynomial time!
4. Image Segmentation
Example
Graph-cut based segmentation:
Pixels = vertices
Adjacent pixels = edges (weight = similarity)
Remove high-weight edges = boundary between segments
Used in: Felzenszwalb-Huttenlocher segmentation algorithm
5. VLSI Circuit Design
Example
Minimum-length wiring to connect all components on a chip.
Saves manufacturing cost and reduces signal delay.
Vertices = components, Edges = possible wire paths, Weights = lengths.
MST = minimum total wiring length.
MST Uniqueness
An MST is unique if and only if all edge weights are distinct.
Proof
If all edges have distinct weights, the cut property uniquely determines
which edge must be included for each cut.
If some edges share weights
Multiple edges might tie for "minimum crossing edge" in a cut,
leading to different but equally-weight MSTs.
Example of non-unique MST
A—1—B—1—C
All edges weight 1.
MSTs: {A-B, B-C} and {A-B, A-C} and {B-C, A-C} ← three MSTs, same weight 2
Properties of MSTs
- An MST has exactly V-1 edges (tree property)
- Removing any edge from MST disconnects the graph (tree property)
- Adding any non-MST edge creates exactly one cycle (tree property)
- MST weight ≤ weight of any spanning tree (by definition)
- For unique weights: MST is unique (cut property uniqueness)
- MST is optimal for min-cost connection: MST always gives minimum total edge weight
Finding Maximum Spanning Tree
Maximum spanning tree (maximum total weight) uses the same algorithms — just negate all weights or sort in descending order:
Example
def maximum_spanning_tree(edges, n):
"""Use Kruskal's with reversed edge ordering."""
edges_sorted = sorted(edges, key=lambda e: -e[2]) # Sort DESCENDING
# Then apply Kruskal's algorithm normally
Applications: Maximum bottleneck paths, maximum reliability networks.
Summary
A Minimum Spanning Tree connects all vertices with minimum total edge weight:
- V-1 edges (tree structure)
- Cut property: Minimum crossing edge for any cut ∈ some MST
- Cycle property: Maximum edge in any cycle ∉ any MST
- Algorithms: Kruskal's (sort+DSU), Prim's (priority queue)
- Time: O(E log E) for Kruskal's, O(E log V) for Prim's
- Uniqueness: Guaranteed only when all edge weights are distinct
*Next Lesson: Prim's Algorithm*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Minimum Spanning Tree — Definition, Properties, and Applications.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, graphs, minimum, spanning
Related Data Structures & Algorithms Topics
Continue learning this concept
GraphsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionMaster Bellman-Ford algorithm completely — why it handles negative weights where Dijkstra fails, the V-1 relaxation rounds, negative cycle detection, SPFA optimization, comparison with Dijkstra, and applications in currency arbitrage and network routing protocols.GraphsBFS Algorithm — Breadth-First Search with All Applications and VariantsMaster Breadth-First Search completely — the level-by-level exploration strategy, complete implementation with queue, BFS tree and shortest path guarantee, detecting bipartite graphs, multi-source BFS, 0-1 BFS, BFS on grids, and all classic BFS interview problems.GraphsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsMaster Depth-First Search completely — recursive and iterative implementations, DFS tree and timestamps, cycle detection in directed and undirected graphs, finding articulation points and bridges, DFS on grids, topological sort foundation, and all classic DFS interview problems.GraphsDijkstraMaster DijkstraGraphsFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisMaster Floyd-Warshall algorithm completely — the all-pairs shortest path approach, the DP recurrence, step-by-step table filling, path reconstruction, negative cycle detection, transitive closure, and comparison with running Dijkstra V times.GraphsGraph Interview Problems — 12 Classic Problems with Complete SolutionsSolve 12 classic graph interview problems — number of islands, clone graph, Pacific Atlantic water flow, number of provinces, word ladder, rotting oranges, critical connections, reconstruct itinerary, swim in rising water, alien dictionary, minimum height trees, and evaluate division.