Given a a Binary Tree, your task is to complete the function getLevelDiff which returns the difference between the sum of nodes at odd level and the sum of nodes at even level . The function getLevelDiff takes only one argument ie the root of the binary tree .
For the above tree the odd level sum is 2 and even level sum is 8 thus the difference is 2-8=-6
The task is to complete the method which takes one argument, root of Binary Tree. There are multiple test cases. For each test case, this method will be called individually.
The function should return an integer denoting the difference between the sum of nodes at odd level and the sum of nodes at even level
1 <=T<= 30
1 <= Number of nodes<= 20
1 2 R 1 3 L
10 20 L 10 30 R 20 40 L 20 60 R
There are two test cases. First case represents a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 3 and right child of 1 is 2. Second test case represents a tree with 4 edges and 5 nodes.
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.