[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

题目分析：

（注意：题目前提是一棵完全二叉树）

先把第一层的next置为NULL，从第一层开始循环，每次循环是将：下一层连接起来（本层已经在每次循环前连接好了，只需要按照链表方式遍历本层节点，可以顺势把下一层连接起来）。