Leetcode 117. Populating Next Right Pointers in Each Node II

方法1: 这题和116题基本一样。同样可以用bfs来做，但是我没去实现，应该不难，所以我就没去实现。

方法2: lc discussion里面的高赞回答。我这边直接放代码，画个图跟着程序走一遍就会明白，不过我不指望我可以在面试里写出这个方法。时间复杂n，空间复杂1.

public class Solution {
    
    //based on level order traversal
    public void connect(TreeLinkNode root) {

        TreeLinkNode head = null; //head of the next level
        TreeLinkNode prev = null; //the leading node on the next level
        TreeLinkNode cur = root;  //current node of current level

        while (cur != null) {
            
            while (cur != null) { //iterate on the current level
                //left child
                if (cur.left != null) {
                    if (prev != null) {
                        prev.next = cur.left;
                    } else {
                        head = cur.left;
                    }
                    prev = cur.left;
                }
                //right child
                if (cur.right != null) {
                    if (prev != null) {
                        prev.next = cur.right;
                    } else {
                        head = cur.right;
                    }
                    prev = cur.right;
                }
                //move to next node
                cur = cur.next;
            }
            
            //move to next level
            cur = head;
            head = null;
            prev = null;
        }
        
    }
}

总结：

• 无