首页 > 代码库 > Problem Populating Next Right Pointers in Each Node II
Problem Populating Next Right Pointers in Each Node II
Problem Description:
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
Solution:
1 public void connect(TreeLinkNode root) { 2 if (root == null) { 3 return; 4 } 5 6 TreeLinkNode cur = root.next; 7 TreeLinkNode p = null; 8 while (cur != null) { 9 if (cur.left != null) {10 p = cur.left;11 break;12 }13 if (cur.right != null) {14 p = cur.right;15 break;16 }17 cur = cur.next;18 }19 20 if (root.right != null) {21 root.right.next = p;22 }23 if (root.left != null) {24 root.left.next = root.right != null ? root.right : p;25 }26 27 connect(root.right);28 connect(root.left);29 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。