Challenge 5: Finding Nodes at "k" Distance From the Root

Problem statement

Implement a function string findKNodes(Node* root, int k) , which finds and returns nodes at k distance from the root in the given binary tree.

Input

This is the root node and a number k.

Output

It returns all nodes in a stringed list format, which are at k distance from the root node.

Sample input

bst = {
    6 -> 4,9
    4 -> 2,5
    9 -> 8,12
    12 -> 10,14
}
where parent -> leftChild,rightChild
k = 2

Sample output

2,5,8,12,