Vertical Sum GFG POTD Python Solution geeks for geeks problem of the day
Problem - https://www.geeksforgeeks.org/problem...
Given a binary tree having n nodes, find the vertical sum of the nodes that are in the same vertical line. Return all sums through different vertical lines starting from the left-most vertical line to the right-most vertical line.
Example 1:
Input:
1
/ \
2 3
/ \ / \
4 5 6 7
Output:
4 2 12 3 7
Explanation:
The tree has 5 vertical lines
Line 1 has only one node 4 = vertical sum is 4.
Line 2 has only one node 2 = vertical sum is 2.
Line-3 has three nodes: 1,5,6 = vertical sum is 1+5+6 = 12.
Line-4 has only one node 3 = vertical sum is 3.
Line-5 has only one node 7 = vertical sum is 7.
Example 2:
Input:
1
/
2
/
3
/
4
/
6
/
7
Output:
7 6 5 4 3 2 1
Explanation:
There are seven vertical lines each having one node