Diagonal Order Sum Of A Binary Tree
medium
1. Given a Binary Tree, print Diagonal order sum of it. 2. For more Information watch given video link below.
Constraints
0 <= Number of Nodes <= 10^5 -1000 <= value of Node data <= 1000
Format
Input
Input is managed for you.
Output
Output is managed for you.
Example
Sample Input
15
4
2
1
-1
-1
3
-1
-1
6
5
-1
-1
7
-1
-1
Sample Output
17 10 1