Tree

The O(n) Club: Minimum Depth of Binary Tree – Stop Calling Null a Leaf ⚡ TL;DR Shortest path from root to an actual leaf (not a lonely child…

The O(n) Club: Range Sum of BST — Prune or Perish Edition ⚡ TL;DR You’re told to sum BST node values within [low, high]. If you brute…

The O(n) Club: Recovering a Corrupted BST: When Two Nodes Pull a Freaky Friday ⚡ TL;DR If two nodes in a BST have swapped their values,…

The O(n) Club: Sum Root to Leaf Numbers—Why Trees Love Place Value (LeetCode 129) ⚡ TL;DR Take a binary tree stuffed with digits (0–9). Walk…

The O(n) Club: Find Duplicate Subtrees and Outsmart Copy-Paste Branches ⚡ TL;DR Cut through the noise: Want to spot all duplicate subtrees in…

The O(n) Club: Find Duplicate Subtrees — Java, HashMaps, and Tree Déjà Vu ⚡ TL;DR If you want to spot all duplicate subtrees in a binary tree…

The O(n) Club: Subtree of Another Tree – How to Find Doppelgänger Branches (and Not Lose Your Mind) ⚡ TL;DR Want to know if subRoot is…

The O(n) Club: Delete Node in a BST — When Trees Demand Therapy ⚡ TL;DR Deleting a node in a BST is three things: drama-free for leaves,…

The O(n) Club: Path Sum and the Java Leaf-Hunting Gauntlet ⚡ TL;DR Loyal binary searchers, here’s the deal: You want to know if any…

The O(n) Club: Lowest Common Ancestor in a BST — The Ancestor Hunt Nobody Asked For ⚡ TL;DR Want to find the nearest shared ancestor in a BST?…