【LeetCode】Populating Next Right Pointers in Each Node II

/**
 * 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) return;
        if(root->left&&root->right) root->left->next=root->right;
        if(root->next)
        {
            TreeLinkNode *tmp=root->right?root->right:root->left;
            if(tmp)
            {
                TreeLinkNode *tmp2=root->next;
                while(tmp2)
                {
                    if(tmp2->left||tmp2->right) break;
                    tmp2=tmp2->next;
                }
                if(tmp2) tmp->next=tmp2->left?tmp2->left:tmp2->right;
            }
        }
        if(root->right) connect(root->right);
        if(root->left) connect(root->left);
    }
};