Special Binary Tree Verification

Determine whether a given binary tree is 'special'. A binary tree is defined as 'special' if every node either has zero or two children.

Example:

Input:

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

Output:

true

Explanation:

In the given binary tree example, each non-leaf node has exactly two children, satisfying the 'special' property.

Constraints:

• 1 <= T <= 5
• 1 <= N <= 10^3
• 0 <= DATA <= 10^9
• ‘DATA’ refers to the value of each node in the binary tree.
• ‘N’ denotes the number of nodes in the BinaryTree.
• Time limit is 1 second.

Input:

The first line contains an integer ‘T’, representing the number of test cases.
Each test case contains a sequence of integers representing the values of the binary tree nodes in level order. Use -1 for NULL nodes.

Output:

For each test case, output a single line with either “true” or “false”.

Note:

You do not need to print anything explicitly; complete the provided function to perform the required checks.