**Compilation/Execution Result:**

Find the level in a binary tree which has the maximum number of nodes. The root is at level 0.

**Note:** The **Input/Output** 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 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.

**Input:**

The first line consists of T test cases. The first line of every test case consists of N, denoting the number of edges in the tree. The second and third line of every test case consists of N, nodes of the binary tree.

**Output:**

Print the level number with maximum nodes.

**Constraints:**

1<=T<=100

1<=N<=100

**Example:
Input:**

2

3

1 2 L 1 3 R 2 4 L

3

1 3 L 1 2 R 2 4 R

1

1

Author: shashwat jain

sj5331 | 87 |

iharshitmittal | 86 |

dauntless | 84 |

rksingh | 74 |

SANJAY5797 | 73 |

Shashank_Pathak | 640 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 381 |

rksingh | 358 |

akhayrutdinov | 4160 |

sanjay05 | 3611 |

Quandray | 2832 |

Ibrahim Nash | 2501 |

Michael Riegger | 2296 |