Level order traversal of a tree is breadth-first traversal for the tree.

Level order traversal of the above tree is 1 2 3 4 5

**Input:**

The task is to complete the method which takes one argument, root of Binary Tree. The struct Node has a data part which stores the data, pointer to left child and pointer to the right child.

There are multiple test cases. For each test case, this method will be called individually.

**Output:**

The function should print the level order traversal of the tree as specified in the problem statement.

**Constraints:**

1 <=T<= 20

1 <= Number of edges<= 1000

1 <= Data of a node<= 100

**Example:
Input:**

2

2

1 2 R 1 3 L

4

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

**Output:**

1 3 2

10 20 30 40 60

There are two test cases. The first case represents a tree with 3 nodes and 2 edges where the root is 1, left child of 1 is 3 and right child of 1 is 2. Second test case represents a tree with 4 edges and 5 nodes.

**Note:** The **Input/Output** format and **Example** are given above 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, and should not print anything on stdout/console. The task is to complete the function specified, and not to write the full code.

Author: kartik

:p | 435 |

Anshul Wadhawan | 414 |

Shivam_Kumar_Singh | 300 |

Calahan | 282 |

facelessman_x | 255 |

Anshul Wadhawan | 874 |

rambo | 868 |

Calahan | 803 |

Shivam_Kumar_Singh | 732 |

Suraj Kumar 14 | 724 |

akhayrutdinov | 4698 |

Ibrahim Nash | 3664 |

sanjay05 | 3633 |

Quandray | 3515 |

surbhi_7 | 2748 |