Interview question | Populating Next Right Pointers in Each Node | javascript

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

[@jishh_anwar]

Found first video which is using js for ds ❤❤

[@amanverma2133]

Pranam sir ji.
Sir ji humme v coding sikhna h, kripya humari madad kare.