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).

AnswerBot
5mo
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 th...read more
Help your peers!
Add answer anonymously...
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

