Perform a diagonal traversal of a binary tree. In a diagonal traversal, nodes are grouped by their diagonal slope; nodes with the same slope are printed together.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.