Given a Binary Tree of size **N**, your task is to complete the function **sumLeaf()**, that should return the sum of all the leaf nodes of the given binary tree.

**Input:**

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

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

**Output:**

The function should return the sum of all the leaf nodes of the binary tree.

**Constraints:**

1<=T<=100

1<=N<=100

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

5

190

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

Ibrahim Nash | 79 |

Stark_Maverick | 77 |

Micky_Kt | 60 |

Lam Ngoc Pham | 58 |

Eduardo Feo | 58 |

Lam Ngoc Pham | 463 |

All Is Well | 399 |

Divvya Sinha | 374 |

Prateek Gole | 369 |

ioan | 323 |

akhayrutdinov | 3855 |

sanjay05 | 3366 |

Michael Riegger | 2028 |

Jasleen Kaur 2 | 2012 |

Quandray | 1965 |