Flip Equivalent Binary Tree Problem

Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a flip equivalent through any number of flip operations.

Flip Operation:

A flip operation involves selecting any node and swapping its left and right subtrees.

Input:

The first line contains an integer 'T' representing the number of test cases.
For each test case, two subsequent lines represent the elements of two binary trees in level order.
Each line lists node values separated by spaces, using -1 to indicate a null node.

Output:

For each test case, output "Yes" if the trees are flip equivalent, otherwise output "No".
Each result should be on a new line.

Example:

Input:

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

Output:

Yes
No

Explanation:

In the first test case, Tree 1 can be transformed into Tree 2 through several flip operations.

Constraints:

• 1 <= T <= 50
• 0 <= N <= 10^3
• 1 <= DATA <= 10^4
• Time Limit: 1 sec

Note:

All tree values are unique. Implement the required function; no need to handle input/output operations.