Convert a Binary Search Tree (BST) to a Greater Sum Tree

Given a Binary Search Tree of integers, transform it into a Greater Sum Tree where each node's value is replaced with the sum of all node values greater than the current node's value in the BST.

Input:

The first line contains an integer 'T', representing the number of test cases. For each test case, the first line contains the BST elements in level order, separated by a space. Use -1 to denote null nodes. For example, the input for a tree can be written as:

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

Output:

For each test case, print the level order traversal of the Greater Sum Tree with nodes values printed in a single-space separated manner. Each test case result should be on a new line.

Example:

Input:

1

11 2 29 1 7 15 40 -1 -1 -1 -1 -1 -1 35 -1

Output:

119 137 75 139 130 104 0

Explanation:

For the input BST, the transformation results in each node being replaced by the sum of values greater than itself.

Constraints:

• 1 <= 'T' <= 100
• 0 <= 'N' <= 1000
• 0 <= 'DATA' <= 10⁴ and 'DATA' != -1

Note: You must modify the given tree directly without creating a new one.