Given a binary tree where each node has data, left, right, and next pointers (initially next is NULL), modify the tree so that each node's 'next' pointer points to the immediate next node on the same level (to the right).

Question

Accepted Answer

Connect each node to its immediate right node on the same level in a binary tree.

Use level order traversal to connect nodes on the same level.
Use a queue to keep track of nodes at each level.
Update the 'next' pointer of each node to point to the next node in the queue.