Compute the alternating vertical sum of a binary tree, where the central vertical line (root) is index 0, and vertical lines have alternating signs (e.g., index 0: +, index 1: -, index 2: +).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.