Populating Next Right Pointers in Each Node
Try to solve the Populating Next Right Pointers in Each Node problem.
We'll cover the following
Statement
Given a next
. This pointer is initially set to NULL
for all nodes. Your task is to connect all nodes of the same hierarchical level by setting the next
pointer to its immediate right node.
The next
pointer of the rightmost node at each level is set to NULL.
Constraints:
- The number of nodes in the tree is in the range .
-
Node.data
Examples
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy