LeetCode:Populating Next Right Pointers in Each Node I II

LeetCode:Populating Next Right Pointers in Each Node 

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

---

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

分析：直接考虑普通的二叉树：层序遍历二叉树，把每一层中前一个节点的next指向后一个节点，使用队列辅助层序遍历时，在队列中用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) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(root == NULL)return;
        queue<TreeLinkNode*> myqueue;
        myqueue.push(root);
        myqueue.push(NULL);//NULL作为队列中每层节点之间的间隔
        TreeLinkNode *pre = NULL;
        while(myqueue.empty() == false)
        {
            TreeLinkNode *p = myqueue.front();
            myqueue.pop();
            if(p != NULL)
            {
                if(p->left)myqueue.push(p->left);
                if(p->right)myqueue.push(p->right);
            }
            else if(myqueue.empty() == false)
                myqueue.push(NULL);
            if(pre != NULL)pre->next = p;
            pre = p;
        }
    }
};

【版权声明】转载请注明出处：http://www.cnblogs.com/TenosDoIt/p/3437497.html