Tree

The O(n) Club: Find Bottom Left Tree Value — When Trees Won’t Hand You the Answer ⚡ TL;DR LeetCode 513: Want to find the leftmost value…

The O(n) Club: BST Mode Madness — Why HashMaps Are Out, and In-Order Is In ⚡ TL;DR Your task: Find the value(s) with the highest frequency…

The O(n) Club: Count Good Nodes in Binary Trees (And Don’t Bring the Whole Family) ⚡ TL;DR How many “good” nodes in a binary…

The O(n) Club: Deepest Leaves Sum — BFS to the Rescue (Again) ⚡ TL;DR Quick summary: Find every leaf node chilling at the bottom of the tree…

The O(n) Club: Maximum Difference Between Node and Ancestor ⚡ TL;DR If you want the maximum absolute difference between a node and any…

The O(n) Club: BST to Greater Sum Tree — The Rich Get Richer (and So Do You) ⚡ TL;DR Want every node in your BST to suddenly feel wealthier?…

The O(n) Club: Binary Tree Pruning — Because Zero Doesn’t Spark Joy ⚡ TL;DR Got a binary tree infested with zero-only branches? Prune…

The O(n) Club: Search in a Binary Search Tree – Or Why Speed Actually Matters ⚡ TL;DR If you use a BST like a random tree, enjoy your O(n)…

The O(n) Club: Insert into a Binary Search Tree – Now With 90% Less Existential Dread ⚡ TL;DR Wanna add a value to a BST without unleashing…

The O(n) Club: Cousins in Binary Tree—Sibling Rivalry, Algorithm Edition ⚡ TL;DR If two nodes are at the same depth but have different…