**Compilation/Execution Result:**

Given a Binary Tree, print Left view of it. Left view of a Binary Tree is set of nodes visible when tree is visited from Left side.

Left view of following tree is 1 2 4 8

1

/ \

2 3

/ \ / \

4 5 6 7

\

8

**Input:**

The task is to complete the method which takes one argument, root of Binary Tree. There are multiple test cases. For each test case, this method will be called individually.

**Output:**

The function should print nodes in left view of Binary Tree.

**Constraints:**

1 <=T<= 100

1 <= Number of nodes<= 100

1 <= Data of a node<= 1000

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

10 20 40

There are two test casess. First case represents a tree with 3 nodes and 2 edges where 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/Ouput** format and **Example** 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. The task is to complete the function specified, and not to write the full code.

Author: kartik

John Carey | 92 |

surbhi_7 | 90 |

mystery | 76 |

Ibrahim Nash | 74 |

Rajat Thakur 2 | 73 |

Ibrahim Nash | 588 |

ashrepos | 490 |

RealHorror | 364 |

shaktiman_shaktiman_shaktiman | 333 |

shi143din | 313 |

akhayrutdinov | 4052 |

sanjay05 | 3406 |

Quandray | 2427 |

Michael Riegger | 2226 |

Jasleen Kaur 2 | 2012 |