**Compilation/Execution Result:**

Given a binary tree, your task is to complete the function **minDepth** which takes one argument the root of the binary tree and prints the min depth of binary tree .

1

/ \

2 3

/

4

For the tree above the min depth is 2 ie 1 3

**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 output will be an integer denoting the min depth of the binary tree.

**Constraints:**

1 <=T<= 30

1 <= Number of nodes<= 20

**Example:
Input:**

2

2

1 2 R 1 3 L

4

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

**Output:**

2

3

There are two test cases. 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: Shubham Joshi 1

Shashank_Pathak | 216 |

dark_knights | 201 |

SANJAY5797 | 196 |

Vasudha Gupta | 168 |

surbhi_7 | 168 |

Shashank_Pathak | 572 |

surbhi_7 | 556 |

dark_knights | 540 |

Infinty | 341 |

Vasudha Gupta | 340 |

akhayrutdinov | 4156 |

sanjay05 | 3607 |

Quandray | 2782 |

Ibrahim Nash | 2475 |

Michael Riegger | 2284 |