# LeetCode -- Populating Next Right Pointers In Each Node

Idea is pretty similiar to `Binary Tree Zigzag Level Order Traversal`

– Traverse through the tree using BFS, and memorize the node at each level in order. Then just link up the nodes.

`Binary Tree Zigzag Level Order Traversal`

– Traverse through the tree using BFS, and memorize the node at each level in order. Then just link up the nodes.