Maximum Average Value Of A Subtree
The first line of input contains an integer 'T' representing the number of test cases. Then the test cases follow. The only line of each test case contains elements in the level order form. The line consists of values of nodes separated by a single space. In case a node is 'null', we take -1 on its place. For example, the input for the tree depicted in the below image would be :
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
Level 1 : The root node of the tree is 1. Level 2 : Left child of 1 = 2 Right child of 1 = 3 Level 3 : Left child of 2 = 4 Right child of 2 = null (-1) Left child of 3 = 5 Right child of 3 = 6 Level 4 : Left child of 4 = null (-1) Right child of 4 = 7 Left child of 5 = null (-1) Right child of 5 = null (-1) Left child of 6 = null (-1) Right child of 6 = null (-1) Level 5 : Left child of 7 = null (-1) Right child of 7 = null (-1) The first not-null node(of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on. The input ends when all nodes at the last level are null(-1).
The above format was just to provide clarity on how the input is formed for a given tree. The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as: 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
For each test case, print the maximum average of node values of any subtree of the given tree. Your output will be considered correct if it differs from the actual output by no more than 10^(-5). Print the output of each test case in a separate line.
You don’t need to print anything; It has already been taken care of.
1 <= T <= 100 1 <= N <= 3000 -10^5 <= data <= 10^5 and data!=-1 Time Limit: 1 second
Distance to a Cycle in Undirected Graph