Solution: Find Nodes at k Distance from the Root

Statement

Given the root node of a binary tree and an integer value k, find all the nodes at a distance of k from the root node.

Constraints:

Let n be the number of nodes in a binary tree.

• $1 \leq$ n $\leq 500$