 Vertical Width of a Binary Tree
##### Submissions: 3762   Accuracy: 54.79%   Difficulty: Easy   Marks: 2

Given a Binary Tree of N nodes. The task is to find the vertical width of the tree.

The width of a binary tree is the number of vertical paths in that tree. The above tree contains 6 vertical lines which is the required vertical width of the tree.

Input:
First line of input contains number of testcases T. For each testcase, there will be two lines, first of which containing the number of edges (between two nodes) in the tree. Next line contains N pairs (considering a and b) with a 'L' (means node b on left of a) or 'R' (means node b on right of a) after a and b.

Output:
For each test case, there will be a single line of output containing the vertical widht of the binary tree.

The task is to complete the function verticalWidth() which takes root as the only parameter, and returns the vertical width of the binary tree.

Constraints:
1 <= T <= 100
1 <= N <= 103

Example:
Input:

3
8
1 2 L 1 3 R 2 4 L 2 5 R 3 6 L 3 7 R 6 8 R 7 9 R
2
1 2 L 1 3 R
5
10 20 L 10 30 R 20 40 L 20 60 R 30 90 L

Output:
6
3
4

Explanation:
See the above given figure.

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harshit Sidhwa
Author: harshitsidhwa

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.