← OYO questions

Find maximum vertical sum in a binary tree

Filed under OYO

Given a binary tree, find the maximum vertical sum. A vertical sum is defined as the sum of all node values that lie on the same vertical line, where a node's left child is at horizontal distance hd…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.