Solve problems that are commonly asked in C++ coding interviews related to common data structures.

Ace the C++ Coding Interview

Data structures are among the fundamentals of computer science and are often a core decision in developing efficient programs. They are categorized as a vital benchmark of computer science knowledge when it comes to industry interviews. This module contains a detailed review of common data structures in C++. We'll also become well-equipped with different data structures by implementing them.
By the end of this module, we'll have expertise in solving problems in data structures.

Data Structures

# 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$
* $0 \leq$ `Node.data` $\leq 10^3$
* All `Node.data` are unique


# Examples

Try to solve the Find Nodes at k Distance from the Root problem.

Challenge 5 : Find Nodes at "k" distance from the Root

Statement