Find maximum vertical sum in binary tree
Last Updated :
02 May, 2025
Given a binary tree, find the maximum vertical level sum in binary tree.
Examples:
Input :
3
/ \
4 6
/ \ / \
-1 -2 5 10
\
8
Output : 14
Vertical level having nodes 6 and 8 has maximum
vertical sum 14.
Input :
1
/ \
5 8
/ \ \
2 -6 3
\ /
-1 -4
\
9
Output : 4
A simple solution is to first find vertical level sum of each level starting from minimum vertical level to maximum vertical level. Finding sum of one vertical level takes O(n) time. In worst case time complexity of this solution is O(n^2).
An efficient solution is to do level order traversal of given binary tree and update vertical level sum of each level while doing the traversal. After finding vertical sum of each level find maximum vertical sum from these values.
Steps to solve this problem:
1. Check if root is equal to null than return 0.
2. Declare an unordered map versum of integer key and value.
3. Declare variables maxsum=INT_MIN and curlev.
4. Declare a queue pair q of node* and integer.
5. Push (root,0) in q.
6. While q is not empty:
*Root= q.front().first.
*Curlev=q.front().second.
*Versum[curlev]+=root->data.
*Check if root->left is not null than push (root->left,curlev-1) in q.
*Check if root->right is not null than push (root->right,curlev+1) in q.
7. Iterate through every pair in versum as it:
*Update maxsum as max(maxsum,it.second).
8. Return maxsum.
Below is the implementation of above approach:
C++
// C++ program to find maximum vertical
// sum in binary tree.
#include <bits/stdc++.h>
using namespace std;
// A Binary Tree Node
struct Node {
int data;
struct Node *left, *right;
};
// A utility function to create a new
// Binary Tree Node
struct Node* newNode(int item)
{
struct Node* temp = (struct Node*)malloc(sizeof(struct Node));
temp->data = item;
temp->left = temp->right = NULL;
return temp;
}
// Function to find maximum vertical sum
// in binary tree.
int maxVerticalSum(Node* root)
{
if (root == NULL) {
return 0;
}
// To store sum of each vertical level.
unordered_map<int, int> verSum;
// To store maximum vertical level sum.
int maxSum = INT_MIN;
// To store vertical level of current node.
int currLev;
// Queue to perform level order traversal.
// Each element of queue is a pair of node
// and its vertical level.
queue<pair<Node*, int> > q;
q.push({ root, 0 });
while (!q.empty()) {
// Extract node at front of queue
// and its vertical level.
root = q.front().first;
currLev = q.front().second;
q.pop();
// Update vertical level sum of
// vertical level to which
// current node belongs to.
verSum[currLev] += root->data;
if (root->left)
q.push({ root->left, currLev - 1 });
if (root->right)
q.push({ root->right, currLev + 1 });
}
// Find maximum vertical level sum.
for (auto it : verSum)
maxSum = max(maxSum, it.second);
return maxSum;
}
// Driver Program to test above functions
int main()
{
/*
3
/ \
4 6
/ \ / \
-1 -2 5 10
\
8
*/
struct Node* root = newNode(3);
root->left = newNode(4);
root->right = newNode(6);
root->left->left = newNode(-1);
root->left->right = newNode(-2);
root->right->left = newNode(5);
root->right->right = newNode(10);
root->right->left->right = newNode(8);
cout << maxVerticalSum(root);
return 0;
}
// Java code for the above approach
import java.util.*;
class Node {
int data;
Node left, right;
Node(int item) {
data = item;
left = right = null;
}
}
class BinaryTree {
// Function to find maximum vertical sum
// in binary tree.
static int maxVerticalSum(Node root) {
if (root == null) {
return 0;
}
// To store sum of each vertical level.
Map<Integer, Integer> verSum = new HashMap<>();
// To store maximum vertical level sum.
int maxSum = Integer.MIN_VALUE;
// To store vertical level of current node.
int currLev;
// Queue to perform level order traversal.
// Each element of queue is a pair of node
// and its vertical level.
Queue<AbstractMap.SimpleEntry<Node, Integer>> q = new LinkedList<>();
q.add(new AbstractMap.SimpleEntry<>(root, 0));
while (!q.isEmpty()) {
// Extract node at front of queue
// and its vertical level.
AbstractMap.SimpleEntry<Node, Integer> front = q.poll();
root = front.getKey();
currLev = front.getValue();
// Update vertical level sum of
// vertical level to which
// current node belongs to.
verSum.put(currLev, verSum.getOrDefault(currLev, 0) + root.data);
if (root.left != null)
q.add(new AbstractMap.SimpleEntry<>(root.left, currLev - 1));
if (root.right != null)
q.add(new AbstractMap.SimpleEntry<>(root.right, currLev + 1));
}
// Find maximum vertical level sum.
for (int levelSum : verSum.values())
maxSum = Math.max(maxSum, levelSum);
return maxSum;
}
public static void main(String[] args) {
/*
3
/ \
4 6
/ \ / \
-1 -2 5 10
\
8
*/
Node root = new Node(3);
root.left = new Node(4);
root.right = new Node(6);
root.left.left = new Node(-1);
root.left.right = new Node(-2);
root.right.left = new Node(5);
root.right.right = new Node(10);
root.right.left.right = new Node(8);
System.out.println(maxVerticalSum(root));
}
}
// This code is contributed by lokeshpotta20.
# Python3 program to find maximum
# vertical sum in binary tree.
from sys import maxsize
from collections import deque
INT_MIN = -maxsize
class Node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
# Function to find maximum vertical sum
# in binary tree.
def maxVerticalSum(root: Node) -> int:
if (root is None):
return 0
# To store sum of each vertical level.
verSum = dict()
# To store maximum vertical level sum.
maxSum = INT_MIN
# To store vertical level of current node.
currLev = 0
# Queue to perform level order traversal.
# Each element of queue is a pair of node
# and its vertical level.
q = deque()
q.append([root, 0])
while (q):
# Extract node at front of queue
# and its vertical level.
root = q[0][0]
currLev = q[0][1]
q.popleft()
# Update vertical level sum of
# vertical level to which
# current node belongs to.
if currLev not in verSum:
verSum[currLev] = 0
verSum[currLev] += root.data
if (root.left):
q.append([root.left, currLev - 1])
if (root.right):
q.append([root.right, currLev + 1])
# Find maximum vertical level sum.
for it in verSum:
maxSum = max([maxSum, verSum[it]])
return maxSum
# Driver code
if __name__ == "__main__":
'''
3
/ \
4 6
/ \ / \
-1 -2 5 10
\
8
'''
root = Node(3)
root.left = Node(4)
root.right = Node(6)
root.left.left = Node(-1)
root.left.right = Node(-2)
root.right.left = Node(5)
root.right.right = Node(10)
root.right.left.right = Node(8)
print(maxVerticalSum(root))
# This code is contributed by sanjeev2552
// C# code for the above approach
using System;
using System.Collections.Generic;
class Node {
public int data;
public Node left, right;
public Node(int item)
{
data = item;
left = right = null;
}
}
public class GFG {
// Function to find maximum vertical sum in binary tree.
static int maxVerticalSum(Node root)
{
if (root == null) {
return 0;
}
// To store sum of each vertical level.
Dictionary<int, int> verSum
= new Dictionary<int, int>();
// To store maximum vertical level sum.
int maxSum = int.MinValue;
// To store vertical level of current node.
int currLev;
// Queue to perform level order traversal. Each
// element of queue is a pair of node and its
// vertical level.
Queue<KeyValuePair<Node, int> > q
= new Queue<KeyValuePair<Node, int> >();
q.Enqueue(new KeyValuePair<Node, int>(root, 0));
while (q.Count > 0)
{
// Extract node at front of queue and its
// vertical level.
KeyValuePair<Node, int> front = q.Dequeue();
root = front.Key;
currLev = front.Value;
// Update vertical level sum of vertical level
// to which current node belongs to.
if (verSum.ContainsKey(currLev)) {
verSum[currLev] += root.data;
}
else {
verSum[currLev] = root.data;
}
if (root.left != null) {
q.Enqueue(new KeyValuePair<Node, int>(
root.left, currLev - 1));
}
if (root.right != null) {
q.Enqueue(new KeyValuePair<Node, int>(
root.right, currLev + 1));
}
}
// Find maximum vertical level sum.
foreach(int levelSum in verSum.Values)
{
maxSum = Math.Max(maxSum, levelSum);
}
return maxSum;
}
static public void Main()
{
// Code
/*
3
/ \
4 6
/ \ / \
-1 -2 5 10
\
8
*/
Node root = new Node(3);
root.left = new Node(4);
root.right = new Node(6);
root.left.left = new Node(-1);
root.left.right = new Node(-2);
root.right.left = new Node(5);
root.right.right = new Node(10);
root.right.left.right = new Node(8);
Console.WriteLine(maxVerticalSum(root));
}
}
// This code is contributed by sankar.
<script>
// Javascript program to find maximum
// vertical sum in binary tree.
// A Binary Tree Node
class Node
{
constructor(item)
{
this.left = null;
this.right = null;
this.data = item;
}
}
// A utility function to create a new
// Binary Tree Node
function newNode(item)
{
let temp = new Node(item);
return temp;
}
// Function to find maximum vertical sum
// in binary tree.
function maxVerticalSum(root)
{
if (root == null)
{
return 0;
}
// To store sum of each vertical level.
let verSum = new Map();
// To store maximum vertical level sum.
let maxSum = Number.MIN_VALUE;
// To store vertical level of current node.
let currLev;
// Queue to perform level order traversal.
// Each element of queue is a pair of node
// and its vertical level.
let q = [];
q.push([ root, 0 ]);
while (q.length > 0)
{
// Extract node at front of queue
// and its vertical level.
root = q[0][0];
currLev = q[0][1];
q.shift();
// Update vertical level sum of
// vertical level to which
// current node belongs to.
if (verSum.has(currLev))
{
verSum.set(currLev, verSum.get(currLev) +
root.data);
}
else
{
verSum.set(currLev, root.data);
}
if (root.left)
q.push([root.left, currLev - 1]);
if (root.right)
q.push([root.right, currLev + 1]);
}
// Find maximum vertical level sum.
verSum.forEach((values, keys)=>{
maxSum = Math.max(maxSum, values);
})
return maxSum;
}
// Driver code
/*
3
/ \
4 6
/ \ / \
-1 -2 5 10
\
8
*/
let root = newNode(3);
root.left = newNode(4);
root.right = newNode(6);
root.left.left = newNode(-1);
root.left.right = newNode(-2);
root.right.left = newNode(5);
root.right.right = newNode(10);
root.right.left.right = newNode(8);
document.write(maxVerticalSum(root));
// This code is contributed by divyesh072019
</script>
Complexity Analysis:
- Time Complexity: O(n)
- Auxiliary Space: O(n)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem