Given the root of a binary tree, flatten it into a linked list in-place using the 'right' pointer as the next pointer and the 'left' pointer set to null.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.