**Compilation/Execution Result:**

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

Example:

```
Input :
1
/ \
2 3
/ \ \
4 5 8
/ \
7 2
Output :
sum = 5 + 8 = 13
```

**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 that are at the minimum level of the binary tree.

**Constraints:**

1<=T<=10^{3}

0<=N<=10^{3}

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

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 |