76. Calculate Vertical Sum in Binary Tree

Objective: - Given a binary tree, print it in vertical order sum

What is Vertical Order Sum

as you can see in the example above, [4],[2], [12],[3],[7] are the vertical order sum of the given binary tree.

Approach:

• Do the inorder traversal.
• Take a variable called level, whenever you go left, do level++ AND whenever you go right do level--.
• With the step above we have separated the levels vertically.
• Now you need to add the elements of each level, so create a dictionary and store the level as the key and the sum of elements at the same level as the value.
• At the end iterate through the dictionary and print the results

Output:

Level -2 Sum : 7
Level -1 Sum : 3
Level 0 Sum : 12
Level 1 Sum : 2
Level 2 Sum : 4

Related Problems:

- In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium
- All N Length Strings from Given String of Length K Medium
- Search the Element in a binary tree - With and Without Recursion Beginner
- Convert BST to Greater Sum Tree Medium
- Print all nested directories and files in a given directory - Recursion Medium