Check If Two Nodes Are Cousins

You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a and b, you need to check if these nodes are cousins.

Two nodes are cousins of each other if they are at the same level and have different parents. Two nodes are said to be at the same level if the distance of both the nodes from the root node is the same.

A binary tree (BT) is a data structure in which each node has at most two children.

For the given binary tree:

4 and 7 are cousins of each other since they are at the same level and have different parents, 3 and 2 respectively.

Input Format:

The first line contains an integer 'T' which denotes the number of test cases  Then the test cases follow.

The first line of each test case contains the elements of the tree in the level order form separated by a single space.

The second line of each contains two space-separated integers which are values present as nodes in the Binary Tree. It is guaranteed that all nodes will have distinct values.

Refer to the example below to understand the input format.
Example:

Elements are in the level order form. The input consists of values of nodes separated by a single space in a single line. In case a node is null, we take -1 in its place.

For example, the input for the tree depicted in the below image would be :

1
2 3
4 -1 5 6
-1 7 -1 -1 -1 -1
-1 -1

Explanation :
Level 1 :
The root node of the tree is 1

Level 2 :
Left child of 1 = 2
Right child of 1 = 3

Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6

Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)

Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)

The first not-null node (of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.

The input ends when all nodes at the last level are null (-1).

Note :

The above format was just to provide clarity on how the input is formed for a given tree. 

The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:

1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1

Output Format:

For each test case, you need to return “YES” if the given two nodes are cousins of each other and “NO”, otherwise.(return without the quotes)

Note:

The Binary Tree has only distinct elements.
You are not required to print the expected output, it has already been taken care of. Just implement the function.

Constraints:

1 <= T <= 100
1 <= N <= 1000
-10^6 <= data <= 10^6 and data != -1

Time Limit: 1 sec