For this Question: Given a Binary Tree, find the maximum width of it. <b>Maximum width</b> is defined as the maximum number of nodes in any level.

For example, maximum width of following tree is 4 as there are 4 nodes at 3rd level.
<pre>
          1
       /     \
     2        3
   /    \    /    \
  4     5  6       7
    \
      8
</pre><b>User Task:</b>
Since this will be a functional problem. You don't have to take input. You just have to complete the function <b>getMaxWidth()</b> that takes "root" node as parameter.

<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10^5
1 <= node values <= 10^5

Sum of "N" over all testcases does not exceed 10^6

For <b>Custom Input:</b>
First line of input should contains the number of test cases T. For each test case, there will be two lines of input.
First line contains number of nodes N. Second line will be a string representing the tree as described below: 
The values in the string are in the order of level order traversal of the tree where, numbers denote node values, and a character “N” denotes NULL child.
<b>Note:</b> If a node has been declared Null using 'N', no information about its children will be given further in the array.Return the maximum width of Binary Tree.Sample Input:
2
3
1 2 3
5
10 20 30 40 60

Sample Output:
2
2

Explanation:
Testcase1: The tree is <pre>
        1
     /      \
   2         3
</pre>
The second level has 2 nodes and hence the width is 2.
Testcase2: The tree is <pre>
        10
     /        \
   20         30
             /      \
           40       60
</pre>Both second and third level have 2 nodes and hence max width is 2., I have written this Solution Code: static int getMaxWidth(Node root)
	{
		 if (root == null)
            return 0;

        int maxWidth = 0;
        Queue<Node> queue = new LinkedList<>();
        queue.add(root);

        while (!queue.isEmpty()) {
            int levelSize = queue.size();

            maxWidth = Math.max(maxWidth, levelSize);

            while (levelSize > 0) {
                Node node = queue.poll();

                if (node.left != null)
                    queue.add(node.left);
                if (node.right != null)
                    queue.add(node.right);

                levelSize--;
            }
        }

        return maxWidth; 
	}, In this Programming Language: Java, Now tell me if this Code is compilable or not?