Print the nodes of a binary tree level by level in reverse topological order (from bottom to top, or equivalently by repeatedly finding, printing, and removing leaf nodes layer by layer).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.