leetcode 116：Populating Next Right Pointers in Each Node I And II

Given a binary tree

    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *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.

Note:

• You may only use constant extra space.
• You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

For example,
Given the following perfect binary tree,

         1
       /  \
      2    3
     / \  / \
    4  5  6  7

After calling your function, the tree should look like:

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

Subscribe to see which companies asked this question

要注意判断 node->left!=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) {}
 * };
 */
class Solution {
public:
    void connect(TreeLinkNode *root) {
        if(root==NULL||root->left==NULL)
            return;
        TreeLinkNode *node=root;
        
        while(node!=NULL&&node->left!=NULL){
            TreeLinkNode *p=node;
            while(p){
                p->left->next=p->right;
                if(p->next)
                p->right->next=p->next->left;
                p=p->next;
            }
            node=node->left;
        }
    }
};

递归

class Solution {
public:
    void connect(TreeLinkNode *root) {
        if(root==NULL||root->left==NULL)
            return;
        TreeLinkNode *p=root;
        while(p){
            p->left->next=p->right;
            if(p->next)
               p->right->next=p->next->left;
            p=p->next;
        }
        connect(root->left);
    }
};

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

Subscribe to see which companies asked this question

public:
    void connect(TreeLinkNode *root) {
        if(root==NULL)
            return;
        TreeLinkNode *node=root;
        
        while( node != NULL ){
            TreeLinkNode *p=node;
            TreeLinkNode *start=NULL;
            TreeLinkNode *subP=NULL;
            while(p){
                if(p->left){
                    subP=p->left;
                    p->left->next=p->right;
                    start=start==NULL?p->left:start;
                }
                if(p->right){
                    subP=p->right;
                    start=start==NULL?p->right:start;
                }
                if(p->next&&subP){
                    subP->next=p->next->left?p->next->left:p->next->right;//不是p，而是subP
                }
                p=p->next;
            }
            node=start;
        }
    }
};

对下一层横向连接时，要记录subP---下一层 当前需要横向连接结点

如下图，结点8横向连接结点9（5号结点的子节点为空，8不能连接5号结点的为空的子节点，只能连接7号的子节点）

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

同时要记录start ----下一层开始结点