Given a binary tree, print its diagonal traversal. In a diagonal traversal, all nodes that share the same number of right-edge traversals from the root are grouped together on the same diagonal.

More specifically, the diagonal index of a node equals the number of right edges on the path from root to that node. Within each diagonal, nodes are printed in the order they appear during a breadth-first traversal of the tree. ...