LeetCode--populating-next-right-pointers-in-each-node-ii

题目描述

Follow up for problem "Populating Next Right Pointers in Each Node".

What if the given tree could be any binary tree? Would your previous solution still work?

Note:

• You may only use constant extra space.

For example,
Given the following binary tree,

         1
       /  \
      2    3
     / \    \
    4   5    7

After calling your function, the tree should look like:

         1 -> NULL
       /  \
      2 -> 3 -> NULL
     / \    \
    4-> 5 -> 7 -> NULL

/**
 * 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) {}
 * };
 */

//核心思路：
//如果当前层所有结点的next 指针已经设置好了，那么据此，下一层所有结点的next指针 也可以依次被设置。
//题目最直观的是层次遍历二叉树，但是要求空间复杂度为常数，所以不能使用队列，栈，递归等方式求解

class Solution 
{
public:
    void connect(TreeLinkNode *root) 
    {
        while(root)
        {
            TreeLinkNode dummy(-1), *prev; //某一层链表的伪头结点
            prev = &dummy;
            for(auto p = root; p; p = p->next)  //某一层链表的遍历
            {
                if(p->left)
                {
                    prev->next = p->left;
                    prev = prev->next;
                }
                if(p->right)
                {
                    prev->next = p->right;
                    prev = prev->next;
                }
            }
            root = dummy.next; // 指向下一层的第一个节点
        }
    }
};