【Leetcode】Populating Next Right Point in Each Node (TL)

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

这道题其实也算是层次遍历的一种，但是它把树和链表综合起来考察了

每一次的第一个节点(curHead)记录为头指针，然后一次把树后面的节点连接起来就OK了

    public void connect(TreeLinkNode root) {  
        if(root==null)
            return;
        TreeLinkNode lastHead = root;
        TreeLinkNode curHead = null;
        TreeLinkNode pre = null;
        
        while(lastHead!=null) {
            TreeLinkNode lastCur = lastHead;
            while(lastCur != null) {
                if(lastCur.left!=null) {
                    if(curHead==null) {
                        curHead=lastCur.left;
                        pre=curHead;
                    }
                    else {
                        pre.next=lastCur.left;
                        pre=pre.next;
                    }
                }
                
                if(lastCur.right!=null) {
                    if(curHead==null) {
                        curHead=lastCur.right;
                        pre=curHead;
                    }
                    else {
                        pre.next=lastCur.right;
                        pre=pre.next;
                    }
                }
                lastCur=lastCur.next;
            }
            lastHead=curHead;
            curHead=null;
        }
    }