Given the root of a binary tree, a target node in the tree, and an integer k, return a list of the values of all nodes that are at a distance of k from the target node.

The answer may be returned in any order.

Constraints:

• The number of nodes in the tree is in the range $[1, 500]$.

• $0 \leq$ Node.val $\leq 500$

• All the values Node.val are unique.

• target is the value of one of the nodes in the tree.

• $0 \leq$ k $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.