Closest Leaf in a Binary Tree
Breadth-first search outward from a target node, treating parent links as edges, until the first leaf appears.
Breadth-first search outward from a target node, treating parent links as edges, until the first leaf appears.