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 →
All Posts
1276 articles
dsa1 min read
Same Tree — Structural and Value Comparison
Check if two binary trees are identical by recursively comparing structure and node values.
Read →
dsa1 min read
Balanced Binary Tree — Height DFS with Early Exit
Check if a binary tree is height-balanced by computing subtree heights and returning -1 early on imbalance.
Read →
dsa1 min read
Merge Two Binary Trees — Recursive Overlay
Merge two binary trees by adding overlapping node values recursively, using existing nodes where possible.
Read →
dsa1 min read
Range Sum of BST — BST Property Pruning DFS
Sum all BST values in [low, high] using BST property to prune entire subtrees outside the range.
Read →
Page 98 of 256