标签：ons div pre bin str etc with pull 二叉树
题目：
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:
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
/** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */ public class Solution { public void connect(TreeLinkNode root) { while(root!=null){ TreeLinkNode tempChild = new TreeLinkNode(0); //记录下一层的首节点 TreeLinkNode curChild = tempChild; while (root!=null){ //遍历某一层的节点，并将该层节点的子节点从左到右添加到下一层中去 if(root.left!=null){ curChild.next=root.left; curChild=curChild.next; } if(root.right!=null){ curChild.next=root.right; curChild=curChild.next; } root = root.next; } root = tempChild.next; //将下一层的首节点装载到root，遍历下一层 } } }
[LeetCode] 117. Populating Next Right Pointers in Each Node II Java
标签：ons div pre bin str etc with pull 二叉树
原文地址：http://www.cnblogs.com/271934Liao/p/7229748.html
