dsa6 min read
Trees — Complete Guide: All Patterns & Problem Index
Master every tree pattern: DFS traversals, BFS level-order, BST operations, LCA, path sum, and serialization — with templates and full index of 75 problems.
Read →
All Posts
1575 articles
dsa1 min read
Maximum Depth of Binary Tree — DFS and BFS Approaches
Find the maximum depth of a binary tree using recursive DFS (one line) or iterative BFS level counting.
Read →
dsa1 min read
Invert Binary Tree — Recursive Swap
Invert a binary tree by recursively swapping left and right children at every node.
Read →
dsa1 min read
Symmetric Tree — Mirror Recursion
Check if a binary tree is symmetric by comparing mirror subtrees with a two-pointer recursive approach.
Read →
dsa1 min read
Path Sum — Root-to-Leaf DFS with Running Remainder
Determine if a root-to-leaf path exists with a given sum using DFS that subtracts each node value from the target.
Read →
Page 157 of 315