Leetcode 742. Closest Leaf in a Binary Tree

Given a binary tree and a target node value, return the value of the nearest leaf measured by edge distance — you may move both down to children and up to parents. The core idea is to treat the tree as an undirected graph (or add parent pointers) and perform a BFS from the target to find the closest leaf.