Given a binary tree, connect nodes at each level using a 'next' pointer in a zig-zag pattern (e.g., level 0 left-to-right, level 1 right-to-left, level 2 left-to-right).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.