~/lc-grind

Flip all 'O's to 'X's except for those connected to the board's edge, which cannot be surrounded.

Traverse this Binary Search Tree in-order to compare consecutive node values and find the smallest possible difference between any two nodes.

Traverse a binary tree level by level, but switch the direction (left-to-right, then right-to-left) after each level for a zigzag pattern.

Efficiently compute the average value of nodes at each level of a binary tree using BFS or DFS traversal.

Capture the rightmost node at each level of a binary tree to reveal its unique "side view" from top to bottom.

Master the classic tree traversal problem of finding the deepest node that is a common ancestor to two given nodes in a binary tree.

Leverage the properties of a complete binary tree to count its nodes in O(log² N) time by combining binary search with height comparisons.

Efficiently traverse a Binary Search Tree in-order, one element at a time, using a stack-based iterator that operates in O(1) average time and O(h) memory.

Traverse every root-to-leaf path in this binary tree, where each path forms a unique number, and return the sum of all these numbers.

Determine if a simple path from the root to any leaf in a binary tree adds up to the given target sum.