Populating Next Right Pointers in Each Node

Try to solve the Populating Next Right Pointers in Each Node problem.


Given a perfect binary treeA binary tree in which all the levels are completely filled with nodes, and all leaf nodes (nodes with no children) are at the same level., where each node contains an additional pointer called 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.


  • The number of nodes in the tree is in the range [0,500][0, 500].
  • 1000-1000 \leq Node.data 1000\leq 1000


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy