All nodes at distance K in a binary tree

Given a binary tree, a target node and k, return every node exactly k edges away from the target. Add parent links (or turn the tree into an undirected graph), then search outward from the target without revisiting nodes.