Given a binary tree, return the difference between the values of the leftmost and rightmost nodes at each level (i.e., leftmost value minus rightmost value, or vice versa depending on convention).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.