Flatten Binary Tree to Linked List

medium

linked-listTime: O(n)Space: O(1)Frequency: 2

Given the root of a binary tree, flatten the tree into a linked list in-place following pre-order traversal.

Example 1:

Input:     1
          / \
         2   5
        / \   \
       3   4   6

Output: 1 -> 2 -> 3 -> 4 -> 5 -> 6
(Each node's left is null, right points to next in pre-order)

Example 2:

Input: root = []
Output: []

stacklinked-listrecursion

Shortcuts

SubmitCtrl↵
Toggle commentCtrl/
Find in codeCtrlF
UndoCtrlZ
Exit fullscreenEsc

Interview tips

→Aim for O(n) time and O(1) space.
→Walk through your approach with a small example first.
→Handle edge cases: empty input, single element, overflow.
→Code is auto-saved as you type — refresh-safe.

linked-listTime: O(n)Space: O(1)Frequency: 2

Given the root of a binary tree, flatten the tree into a linked list in-place following pre-order traversal.

Example 1:

Input:     1
          / \
         2   5
        / \   \
       3   4   6

Output: 1 -> 2 -> 3 -> 4 -> 5 -> 6
(Each node's left is null, right points to next in pre-order)

Example 2:

Input: root = []
Output: []

stacklinked-listrecursion