Given a binary tree, print postorder traversal of it. Postorder traversal of below tree is 5 10 39 1

        1
     /     \
   10     39
  /
5

Input Format:
First line of input contains the number of test cases T. For each test case, there will be only a single line of input which is a string representing the tree as described below: 

1. The values in the string are in the order of level order traversal of the tree where, numbers denotes node values, and a character “N” denotes NULL child.

2. For example:
   
   For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N

Output Format:
For each test case, in a new line, print the postorder traversal.

Your Task:
You don't need to take input. Just complete the function postOrder() that takes node as parameter. The newline is automatically appended by the driver code.

Constraints:
1 <= T <= 100
1 <= Number of nodes <= 100
1 <= Data of a node <= 1000

Example:
Input:
2
19 10 8 11 13
11 15 N 7
Output:
11 13 10 8 19
7 15 11
Explanation:
Testcase1: The tree is
       19
     /      \
   10      8
  /    \
11   13
So, the postorder would be 11 13 10 8 19 .
Testcase2: The tree is
                          11
                         /
                      15
                       /
                     7
So, the postorder would be 7 15 11.

Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

** For More Input/Output Examples Use 'Expected Output' option **