117. Populating Next Right Pointers in Each Node 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

 题目含义：从左到右连接每一层的节点

1 public void connect(TreeLinkNode root) { 2 while(root != null){ 3 TreeLinkNode tempChild = new TreeLinkNode(0); 4 TreeLinkNode currentChild = tempChild; 5 while(root!=null){ 6 if(root.left != null) { currentChild.next = root.left; currentChild = currentChild.next;} 7 if(root.right != null) { currentChild.next = root.right; currentChild = currentChild.next;} 8 root = root.next; 9 } 10 root = tempChild.next; 11 } 12 }

 

 

 

转载于:https://www.cnblogs.com/wzj4858/p/7715047.html

总结

以上是生活随笔为你收集整理的117. Populating Next Right Pointers in Each Node II的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。