Given a Binary Tree and a number **k**. Print all nodes that are at distance k from root (root is considered at distance 0 from itself). Nodes should be printed from left to right. If k is more that height of tree, nothing should be printed.

For example, if below is given tree and k is 2. Output should be 4 5 6.

1

/ \

2 3

/ / \

4 5 6

\

8

**Input:**

The task is to complete the method which takes two arguments, root of Binary Tree and k. The struct Node has a data part which stores the data, pointer to left child and pointer to right child. There are multiple test cases. For each test case, this method will be called individually.

**Output:**

The function should print nodes at k distance from root. Nodes should be printed from left to right.

**Constraints:**

1 <= T <= 30

1 <= Number of edges<= 100

0 <= k <= height of tree

1 <= data of node <= 1000

**Example:
Input:**

2

2 0

1 2 R 1 3 L

4 2

10 20 L 10 30 R 20 40 L 20 60 R

**Output:**

1

40 60

**Explanation:
Testcase 1:** First case represents a tree with 3 nodes, 2 edges and value of k as 0. Here root is 1, left child of 1 is 3 and right child of 1 is 2.

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

bruceewayne | 160 |

manvirag982 | 134 |

Core_Ka_Bachha | 133 |

rajupraaa1234 | 131 |

vinu_ramanan | 123 |

mr_kksparrow | 433 |

manvirag982 | 350 |

rajupraaa1234 | 266 |

Exception_404 | 250 |

PranathiBhuvanagiri | 242 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.