Iterative Pre, Post And Inorder Traversals Of Binary Tree
easy
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.
Constraints
None
Format
Input
Input is managed for you
Output
pre order (elements separated by space) in order (elements separated by space) post order (elements separated by space)
Example
Sample Input
19
50 25 12 n n 37 30 n n n 75 62 n 70 n n 87 n n
Sample 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
Question Video