Node With Maximum Subtree Sum
medium
1. You are given a partially written GenericTree class. 2. You are required to find and print the node which has the subtree with largest sum. Also print the sum of the concerned subtree separated from node's value by an '@'. Refer the question video for clarity. 3. Input is managed for you.
Constraints
None
Format
Input
Input is managed for you
Output
@
Example
Sample Input
20
10 20 -50 -1 60 -1 -1 30 -70 -1 80 -1 90 -1 -1 40 -100 -1 -1 -1
Sample Output
30@130
Question Video