Given the root of a binary tree, return its diagonal traversal. In a diagonal traversal, nodes belonging to the same diagonal line (from top-left to bottom-right) are grouped together, starting from…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.