Connect Next Pointers in Perfect Binary Tree

Question Explain

Populate each next pointer to point to its next right node in a perfect binary tree. If there is no next right node, the next pointer should be set to `NULL`. Solve using BFS or recursion.