Check if Two Trees are Mirror

Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.

Explanation:

Two trees are considered mirror of each other if:

• The roots of both the trees are the same.
• The left subtree of the root of the first tree is the mirror of the right subtree of the root of the second tree.
• The right subtree of the root of the first tree is the mirror of the left subtree of the root of the second tree.

Input:

The first line contains an integer ‘T’ representing the number of test cases. For each test case:

The first line contains elements of the first tree in level order format, where node values are separated by spaces. A node with value -1 is considered null.

The second line contains elements of the second tree in level order format, where node values are separated by spaces. A node with value -1 is considered null.

Output:

For each test case, output “true” if the two trees are mirrors of each other; otherwise, output “false” on a separate line for each test case.

Example:

Input:
1
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 7 -1 -1 -1

Constraints:

• 1 <= T <= 80
• 1 <= N, M <= 3000
• -10⁶ ≤ data ≤ 10⁶, where data ≠ -1

Note:

The function does not require printing anything; it is handled internally. Focus on implementing the logic to determine if two trees are mirror of each other.