Populating Next Right Pointers in Each Node_Part_1

Write a function to connect all the adjacent nodes at the same level in a binary tree. This video discusses a solution that uses level order traversal. In the next part of this video we discuss a more optimized solution that takes constant extra memory. You can watch that solution in the following link: https://www.youtube.com/watch?v=5GS17j6tcOk This is a more general solution to the specific problem in leetcode.com at the following link: https://leetcode.com/problems/populating-next-right-pointers-in-each-node/ ------------------------- Join our 30-days online course to prepare for coding interviews of companies like Google, Amazon, Facebook, Microsoft, etc. Course On Coding: http://www.ritambhara.in/big-o/ Course On System Design: http://www.ritambhara.in/system-design-for-coding-interview/ We have our office in Greater Noida (India) where we run courses for students to prepare them for placements in Top IT companies. For Placement Preparation and Industrial Training call us. Call: +91-8377803450 Email: [email protected] Call us to conduct a workshop in your college campus. Buy our books and prepare for coding interviews on your own. https://www.amazon.in/Kamal-Rawat/e/B0765VFLKD/ref=dp_byline_cont_book_2 For detailed discussions on Interview Questions visit: http://www.ritambhara.in/