1. You are given a partially written BinaryTree class. 2. You are given a value k. 3. You are required to complete the body of printKLevelsDown function. The function is expected to print in different lines all nodes which are k level deep. Use preorder for printing. 4. Input is managed for you.
Input Format
Input is managed for you
Output Format
All nodes k-level deep printed in separated lines and visited in preorder
Constraints
None
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
19 50 25 12 n n 37 30 n n n 75 62 n 70 n n 87 n n 3
Output
30 70