**Compilation/Execution Result:**

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: Harshit Sidhwa

Pulkit Gupta 2 | 130 |

Relentless | 124 |

Ibrahim Nash | 94 |

nancygarg258_pec | 90 |

darkswordsman | 90 |

Ibrahim Nash | 602 |

KartikAgarwal | 541 |

rs119574 | 371 |

surbhi_7 | 356 |

Little Noah | 335 |

akhayrutdinov | 4261 |

sanjay05 | 3633 |

Ibrahim Nash | 3162 |

Quandray | 3028 |

Michael Riegger | 2359 |