fx
DSA Mastery
Learn
Explore
Patterns
Books
Geo Book
Patterns
/
Part II - Linked Structures
/
Trees
All Patterns
Two Pointers
Sliding Window
Binary Search
Prefix Sum
Two Sum Family
Array Tricks
Difference Array
Contribution Technique
Binary Search on Answer
Permutation Patterns
Word Break Variants
Shortest Common Supersequence
Kadane's Algorithm Variants
Two Pointers - Advanced
Cyclic Sort
Linked List
Trees
Advanced Trees
Sparse Table
Segment Tree with Lazy Propagation
Cycle Detection
Tree Construction
Lowest Common Ancestor
DSU on Tree (Sack)
Tree Diameter
Offline LCA
Tree Isomorphism
Persistent Union-Find
Binary Lifting
Segment Tree Basics
Tree Path Problems
Iterative Tree Traversal
Heap / Priority Queue
Trie
Monotonic Stack
Hashmap Patterns
Stack & Queue
Counting Patterns
K-th Element
Monotonic Queue
Two Heaps
Bracket Sequences
Amortized Patterns
Expression Parsing
Trie XOR
K-Way Merge
Dynamic Programming
Backtracking
Greedy
Graph
Shortest Path
Bitmask DP
Divide & Conquer
Knapsack DP
Graph - Advanced
Bipartite / Bicoloring
Coordinate Compression
Topological Sort
Minimum Spanning Tree
Network Flow
Meet in the Middle
Convex Hull Trick
Centroid Decomposition
Line Sweep
2-SAT
Bridges & Articulation Points
Min-Cost Max-Flow
Flow with Lower Bounds
Bidirectional BFS
A* Search
Difference Constraints
Functional Graphs
Matching via Flow
Graph Coloring
Top-K Streaming
Strongly Connected Components
Graph State Space
Greedy Intervals
Constructive Algorithms
Backtracking with Pruning
Multi-Source BFS
Grid Islands
String Algorithms
String Matching
Sequences
Matrix / Shape
String DP
Palindrome Patterns
String Hashing
Suffix Array
Aho-Corasick
Z-Function
Manacher's Algorithm
Suffix Automaton
String Rotations
Lyndon Factorization
String Construction
String Window Patterns
Math
Bit Manipulation
Combinatorics
Game Theory
Geometry
Number Theory
Probability DP
Ternary Search
Fast Fourier Transform
Sprague-Grundy Theorem
Chinese Remainder Theorem
Convex Hull
Inclusion-Exclusion
Catalan Numbers
Josephus Problem
Sieve Variants
Burnside's Lemma
Gray Code
Gaussian Elimination GF(2)
Lucas' Theorem
Lattice Paths
Advanced Counting DP
Rotating Calipers
Carry DP
Random Walk
Number Tricks
Linear Algebra
Numerical Methods
Scheduling
Shapes / Geometry
Miscellaneous
Design Patterns
Sorting Algorithms
Simulation
Matrix Exponentiation
Randomized Algorithms
Multiset & Ordered Set
BFS vs DFS
Interval Problems
DP on Trees
Union-Find (DSU)
Digit DP
Interval DP
Grid DP
State Machine DP
Recursion + Memoization
Grid Patterns
Fenwick Tree (BIT)
Heavy-Light Decomposition
Euler Tour (ETT)
Mo's Algorithm
XOR Basis / Linear Basis
Euler Path / Circuit
Divide & Conquer DP
Square Root Decomposition
Persistent Segment Tree
Treap (Randomized BST)
Offline CDQ Divide & Conquer
Bitset Operations
Slope Trick
Segment Tree Beats
Balanced DP
Profile DP (DP on Broken Profile)
Aliens Trick (Lagrange DP)
Arithmetic DP
Subsequence Counting
Sliding Window - Advanced
2D Prefix Sum
DP with Deque Optimization
Stock Trading
DP Space Optimization
String Window Patterns
Pattern Reference
Trees
"Binary trees, BSTs, traversals (in/pre/post/level), LCA, diameter."
Loading...
← All Patterns