Tag

Tree DFS

Articles tagged Tree DFS on The Augmented Dev.

11 articles

Jul 19, 20263 min read

Binary Tree Maximum Path Sum: The Hard Version of Diameter

Any-to-any max path — clamp negative arms to zero and track the bend. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

Return one thing, track another — the two-quantity DFS shape. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

The famous swap-children recursion — and its iterative twin. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

Return what you found — the split node emerges from the recursion. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

The four-line recursion that teaches the subtree-answer discipline. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

The most-asked grid question — sink each island as you count it. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

Collect all matching root-to-leaf paths — append, recurse, pop. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

Root-to-leaf target sums — subtract as you descend, decide at leaves. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

Walk two trees in lockstep — the base-case ordering does the work. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

Check mirror symmetry by walking outer-outer and inner-inner pairs. Python solution and complexity analysis for the DFS interview pattern.

Jul 19, 20263 min read

The local-check trap, defeated by passing (low, high) down the tree. Python solution and complexity analysis for the DFS interview pattern.