Leaves at Same Level Problem Statement

Given a binary tree with 'N' nodes, determine if all the leaf nodes are situated at the same level. Return true if all the leaf nodes are at the same level, otherwise return false.

A binary tree is a hierarchical data structure where each node has at most two children. A node is considered a leaf node if both its left and right children are null.

Input:

The first line contains a single integer T representing the number of test cases. 
The first line of each test case contains elements in level order form (refer to the example below), separated by space. If a node does not have a left or right child, use -1 in its place.

Output:

For each test case, print "True" if all the leaf nodes are at the same level, otherwise print "False". Each test case's output should be on a separate line.

Example:

Input:

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

Output:

True

Explanation:

In the given binary tree:

• Level 1: Node 1 is the root.
• Level 2: Node 2 is the left child and Node 3 is the right child of 1.
• Level 3: Node 4 is the left child of 2; Node 5 is the left child and Node 6 is the right child of 3.
• Level 4: Node 7 is the right child of 4. Nodes 5 and 6 have no children.
• All leaf nodes (5, 6, 7) are at the same level hence the output is True.

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 3000

Time Limit: 1 sec