Populating Next Right Pointers in Each Node II
问题：
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:
For example,
Given the following perfect binary tree,
思路：
队列
我的代码：
public class Solution { public void connect(TreeLinkNode root) { if(root == null) return; Queue<TreeLinkNode> queue = new LinkedList<TreeLinkNode>(); queue.offer(root); while(!queue.isEmpty()) { int size = queue.size(); TreeLinkNode head = queue.poll(); if(head.left != null) queue.offer(head.left); if(head.right != null) queue.offer(head.right); for(int i = 1; i < size; i++) { TreeLinkNode cur = queue.poll(); if(cur.left != null) queue.offer(cur.left); if(cur.right != null) queue.offer(cur.right); head.next = cur; head = cur; } head.next = null; } return; } }
Populating Next Right Pointers in Each Node II
原文：http://www.cnblogs.com/sunshisonghit/p/4320516.html
