1. You are given a partially written BinaryTree class. 2. You are required to complete the body of iterativePrePostInTraversal function. The function is expected to print pre order, in order and post order of the tree in separate lines (first pre, then in and finally post order). All elements in an order must be separated by a space. 3. Input is managed for you.
Input Format
Input is managed for you
Output Format
pre order (elements separated by space) in order (elements separated by space) post order (elements separated by space)
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
Output
50 25 12 37 30 75 62 70 87 12 25 30 37 50 62 70 75 87 12 30 37 25 70 62 87 75 50