### Binary Tree Problem

 
Printing Nodes at distance k of given binary tree

Given a root of a tree, and an integer k. Print all the nodes which are at k distance from root.

EXAMPLE TREE GIVEN :

10

/ \

20 30

/ \ / \

40 50 70 80

#### Approach : Recursive Implementation