Print nodes at K distance from root in binary tree. OR
Print nodes at Level K.
Given a Binary Tree, Print all Nodes that are at K distance from root node in Binary Tree. We can also think of this question as Print all nodes that belong to Level K.
Lets understand what will be input and expected output with the help of an example.
It also means we need to print all nodes at Level 2, because all Nodes of Level 2 will be at same distance from Root Node.