2 posts tagged with "binary-trees"

A conversation about solving the Lowest Common Ancestor problem that reveals one of the most elegant patterns in tree recursion—using return values to communicate information upward through the call stack.

A conversation about solving the Widest Binary Tree Level problem that reveals how mathematical position formulas and DFS traversal create an elegant solution—and why we need to track both min and max positions at each level.