Given the root of a binary tree, extract all leaf nodes into a doubly linked list (DLL) in left-to-right order. Return the head of the DLL, and remove the leaves from the original binary tree.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.