# Flatten Binary Tree To Linked List: Walkthrough
Flatten Binary Tree To Linked List shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Reverse postorder (right, left, node): keep a prev pointer and set node.right = prev, node.left = null, then prev = node, which builds the list from the tail.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n) extra O(1) if you use the Morris/prev trick.
## Common mistake
Building a new list of nodes instead of rearranging the existing right pointers in place.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at learn more.