A binary tree problem - Populating next right pointers in each node | LeetCode

Given a binary tree

struct Node { Node* leftChild; Node* rightChild; Node* nextRight; }

1 2 3 4 5

struct Node {   Node* leftChild;   Node* rightChild;   Node* nextRight; }

Populate the nextRight pointers in each node.

You may assume that it is a full binary tree (ie, each node other than the leaves has two children.)

Read full article from A binary tree problem – Populating next right pointers in each node | LeetCode