LeetCode Populating Next Right P

void connect(TreeLinkNode *root) {
        TreeLinkNode* dummy = new TreeLinkNode(0);
        while(root){
            TreeLinkNode* tmp = dummy;
            while(root){
                if(root -> left){
                    tmp -> next = root -> left;
                    tmp = tmp -> next;
                }
                if(root -> right){
                    tmp -> next = root -> right;
                    tmp = tmp -> next;
                }
                root = root -> next;
            }
            root = dummy -> next;
            dummy -> next = NULL;
        }
    }

加入一个dummy可以标识下一层的第一个结点位置，而且简化了判断条件。