Flatten Binary Tree to Linked List

medium

Acceptance: 54%

Binary TreeLinked List

Transform a binary tree into a singly linked list arranged in pre-order sequence, reusing the existing tree nodes. In the resulting structure, every node's left child pointer is null and its right child pointer leads to the next node in pre-order.

Examples

Example 1:

Input:root = [5,3,8,1,4,null,9]

Output:[5,null,3,null,1,null,4,null,8,null,9]

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Flatten Binary Tree to Linked List

Examples

Hints

Related Problems