Populating next right pointers in each node

Problem: point all nodes of a binary tree to a node on its right.
Analysis: For each node, the operations are the same. Except that his left son points to his right son, all his right sons point to all his right sons.

/*** Definition for Binary Tree with next pointer. * struct treelinknode {* int val; * treelinknode * left, * right, * Next; * treelinknode (int x): Val (x), left (null ), right (null), next (null) {}*}; */class solution {public: void connect (treelinknode * root) {If (root = NULL) return; treelinknode * left, * right; left = root-> left, right = root-> right; while (left & right) {left-> next = right; left = left-> right; Right = right-> left;} connect (root-> left); Connect (root-> right );}};