Very comforting, the interviewer asked about temp in my locality, how was my day, which movies I watch – all these things to relax me.

When I got relaxed, he then asked a simple DSA problem (117. Populating Next Right Pointers in Each Node II on LeetCode).

I gave both approaches. He seemed satisfied with the approaches.

Then he asked me if I have any questions. I asked about his work.

I was happy with my experience in the interview. A few hours later, I got my rejection mail.

Given a binary tree

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