Binary Tree Distance K from Target Node

Prereq: BFS on Tree

Given a binary tree, a target node, and a integer K, find all nodes whose depth (level) is K away from the target node's depth. Order of returned nodes does not matter.