117 Populating Next Right Pointers in Each Node II

1 题目

Given a binary tree

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

 

Example:

Input: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":null,"right":null,"val":4},"next":null,"right":{"$id":"4","left":null,"next":null,"right":null,"val":5},"val":2},"next":null,"right":{"$id":"5","left":null,"next":null,"right":{"$id":"6","left":null,"next":null,"right":null,"val":7},"val":3},"val":1}

Output: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":{"$id":"4","left":null,"next":{"$id":"5","left":null,"next":null,"right":null,"val":7},"right":null,"val":5},"right":null,"val":4},"next":{"$id":"6","left":null,"next":null,"right":{"$ref":"5"},"val":3},"right":{"$ref":"4"},"val":2},"next":null,"right":{"$ref":"6"},"val":1}

Explanation: Given the above binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B.
 

Note:

You may only use constant extra space.
Recursive approach is fine, implicit stack space does not count as extra space for this problem.

 2 尝试解

class Solution {
public:
    Node* connect(Node* root) {
        Node* head = root; //head is the beginning of the lower layer
        Node* pre = NULL; //pre is the pointer of lower layer
        Node* cur = root; //cur is the pointer of higher layer
        while(head != NULL){ //check if out of the bottom layer
            head = NULL;  //set blank, if to the bottom layer, it will always be NULL so this will interrupt
            while(cur != NULL){
                if(cur->left != NULL){
                    if(pre==NULL) head = cur->left;
                    else pre->next = cur->left;
                    pre = cur->left;
                }
                if(cur->right != NULL){
                    if(pre==NULL) head = cur->right;
                    else pre->next = cur->right;
                    pre = cur->right;
                }
                cur = cur->next;
            }
            pre = NULL;  //set blank for next layer
            cur = head;
        }
        return root;
    }
};

3 标准解

void connect(TreeLinkNode *root) {
    TreeLinkNode *now, *tail, *head;
    
    now = root;
    head = tail = NULL;
    while(now)
    {
        if (now->left)
            if (tail) tail = tail->next =now->left;
            else head = tail = now->left;
        if (now->right)
            if (tail) tail = tail->next =now->right;
            else head = tail = now->right;
        if(!(now = now->next))
        {
            now = head;
            head = tail=NULL;
        }
    }
}