Binary tree traversal to populate next right pointer in a perfect binary tree

Given a perfect binary tree populate the next right pointer to all its nodes and null if it isnt present You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL. Initially, all next pointers are set to NULL.

graph TD;
	1-->2;
	1-->3;
    2-->4;
	2-->5;
	3-->6;
	3-->7;

The snippet shows backtracking traversal of all paths from source to destination