Given the root of a binary tree, return its zig-zag (spiral) level order traversal: left to right on the first level, right to left on the next, alternating.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.