LCA of Three Nodes Problem Statement

You are given a Binary Tree with 'N' nodes where each node contains an integer value. Additionally, you have three integers, 'N1', 'N2', and 'N3'. Your task is to find the Lowest Common Ancestor (LCA) of the nodes corresponding to these three integers in the Binary Tree.

Example:

Input:

T = 1
N1 = 7, N2 = 8, N3 = 10
Binary Tree (Level Order): 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1

Output:

1

Explanation:

In the given binary tree, the LCA of nodes 7, 8, and 10 is node 1.

Constraints:

• 1 <= T <= 10
• 1 <= N <= 10⁵
• 0 <= node data <= 10⁹
• 0 <= N1, N2, N3 <= 10⁹

Note:

All node values in the binary tree are unique. Each of N1, N2, and N3 will always exist in the binary tree.

Input:

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

Three integers N1, N2, and N3.
A level-order traversal of the tree nodes as space-separated integers, where -1 indicates a null node.

Output:

For each test case, return the value of the LCA node.

Note:

You do not need to print anything, just implement the given function.