540. Binary Tree to LL

0

Medium

Given the root of a binary tree, flatten the tree into a "linked list":
The "linked list" should use the same Node class where the right child pointer points to the next node in the list and the left child pointer is always null.
The "linked list" should be in the same order as a pre-order traversal of the binary tree.

Input Format

You have to first form the binary tree for the given input.

Output Format

The "linked list" should be in the same order as a pre-order traversal of the binary tree.

Example

Input

1 2 5 3 4 N 6

Output

1 2 3 4 5 6

Constraints

The number of nodes in the tree is in the range [0, 2000].

Loading...

View Submissions

Console