#1516Medium· asked at 3 companies
Populating Next Right Pointers in Each Node
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: root = [1,2,3,4,5,6,7] Output: [1,#,2,3,#,4,5,6,7,#]
The output shows each level with '#' marking the end of a level.
Example 2
Input: root = [] Output: []
Constraints
- •
The number of nodes in the tree is in the range
[0, 2^12 - 1]. - •
-1000 <= Node.val <= 1000