114. Flatten Binary Tree to Linked List
Medium
30 Points
Linked List
Stack
Tree
Depth-First Search
Binary Tree
Given the root of a binary tree, flatten the tree into a "linked list":
Examples
Example 1
Input: root = [1,2,5,3,4,null,6]
Output: [1,null,2,null,3,null,4,null,5,null,6]
Example 2
Input: root = []
Output: []
Example 3
Input: root = [0]
Output: [0]
Constraints
The number of nodes in the tree is in the range [0, 2000].-100 <= Node.val <= 100
114. Flatten Binary Tree to Linked List
Medium
30 Points
Linked List
Stack
Tree
Depth-First Search
Binary Tree
Given the root of a binary tree, flatten the tree into a "linked list":
Examples
Example 1
Input: root = [1,2,5,3,4,null,6]
Output: [1,null,2,null,3,null,4,null,5,null,6]
Example 2
Input: root = []
Output: []
Example 3
Input: root = [0]
Output: [0]
Constraints
The number of nodes in the tree is in the range [0, 2000].-100 <= Node.val <= 100