Given a binary tree of size **N**, your task is to complete the function **printOddNodes(), **that print's the nodes of binary tree present at odd level of the tree.At each level print nodes in any left to right order. Root is considered at level 1.

```
For example consider the following tree
1
/ \
2 3
/ \ \
4 5 6
/ \ /
7 8 9
Output 1 4 5 6
```

**Input:**

The function takes a single argument as input, the reference pointer to the **root **of the binary tree.

There will be **T** testcases and for each test case the function will be called separately.

**Output:**

For each test case print space separated all the nodes of the tree that are present at odd level starting from level 1.

**Constraints:**

1<=T<=100

1<=N<=500

**Example:
Input:**

2

2

1 2 L 1 3 R

5

10 20 L 10 30 R 20 40 L 20 60 R 30 90 L

1

10 40 60 90

**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.

Author: harshitsidhwa

TheRagnarok | 107 |

Abhay Raghav | 80 |

TS006 | 78 |

rajpratim Bhattachar | 71 |

PriyaGupta6 | 70 |

skirmish | 420 |

Mithun Kumar | 404 |

???151 | 401 |

Deepanshu8391 | 391 |

ultra_instinct | 369 |

akhayrutdinov | 4748 |

Quandray | 3922 |

sanjay05 | 3668 |

Ibrahim Nash | 3664 |

surbhi_7 | 2816 |