Given a binary tree, return the rightmost node at each level. If multiple nodes exist at the same vertical depth, prioritize the node with the largest vertical depth.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.