[Leetcode]Populating Next Right Pointers in Each Node I && II

I

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

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指向当前节点即可。两道题用这个思路解决的话没有任何区别。

public void connect(TreeLinkNode root) {
        if (root == null) 
            return;
        
        Queue<TreeLinkNode> q = new LinkedList<TreeLinkNode>();
        q.add(root);
        int levelNum = 1;
        
        while (!q.isEmpty()) {
            TreeLinkNode pre = null;
            for (int i = 0; i < levelNum; i++) {
                TreeLinkNode node = q.poll();
                if (node == null)
                    continue;
                q.add(node.left);
                q.add(node.right);
                if (pre != null) {
                    pre.next = node;
                }
                pre = node;
            }
            levelNum = q.size();
        }
    }