Back to DSA sheet

Populating Next Right Pointers in Each Node

MediumBinary Trees
Open on LeetCodeAmazonGoogleMicrosoft

In a perfect binary tree, set each node's next pointer to the node to its right on the same level, or null.

Constraints
  • 0 <= nodes <= 2^12 - 1
  • The tree is perfect
Sheets
Blind 75NeetCode 150NeetCode 250
populating-next-right-pointers-in-each-node.cpp
Loading editor
Custom input (stdin)
Output

Run your code to see its output.