Given a Binary Tree, create a singly linked list of all its leaf nodes using the right pointer of each tree node as the next pointer, without using extra memory, and return the head pointer.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.