← Questions
Flatten a binary tree to a linked list
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Flatten a binary tree in place into a chain that follows pre-order, using the right pointers as next and setting every left pointer to null.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Write and test your solution herePython in your browser, the question's tests level by level, saved for you.Sign in to start coding