Given a binary tree, compute the sum of all nodes lying on each diagonal slope. A diagonal is defined such that for a node at (x, y), its right child is at (x+1, y) and its left child is at (x, y-1).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.