Maximum Level Sum in Binary Tree Problem Statement

Given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, your task is to find the maximum sum for any level in the tree.

Example:

Input:

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

Output:

13

Explanation:

The maximum level sum is 13 for level 3 from node values (5+6+2) or level 1 (17-4).

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 3000
• -1000 ≤ data ≤ 1000
• data ≠ -1

Note:

• The input for a tree is provided as a single line of integers separated by spaces, representing level order traversal where '-1' denotes a null node.