首页 > 代码库 > 117. Populating Next Right Pointers in Each Node II
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
通过前一行的next,来找下一行的next。用两个指针prevLevelStart和prev, 分别指向前一行有孩子的第一个节点,和用来连接当前行时、前一行的辅助节点。
与116相比,只是updatePrevLevelStart和updatePrev的规则变了。
对116由于是perfect binary tree:
prevLevelStart = prevLevelStart.left
prev = prev.next
对117题,要跳过空节点。 30%
/** * 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) { TreeLinkNode prevLevelStart = root, prev, cur; while (prevLevelStart != null) { prev = prevLevelStart; if (prev.left != null) { cur = prev.left; } else { cur = prev.right; prev = updatePrev(prev); } while (prev != null) { if (cur == prev.left) { if (prev.right != null) { cur.next = prev.right; cur = cur.next; } prev = updatePrev(prev); } else { if (prev.left != null) { cur.next = prev.left; cur = cur.next; } else { cur.next = prev.right; cur = cur.next; prev = updatePrev(prev); } } } prevLevelStart = updatePrevLevelStart(prevLevelStart); } } public TreeLinkNode updatePrev(TreeLinkNode prev) { prev = prev.next; while (prev != null && prev.left == null && prev.right == null) { prev = prev.next; } return prev; } public TreeLinkNode updatePrevLevelStart(TreeLinkNode prevLevelStart) { while (prevLevelStart != null) { if (prevLevelStart.left != null && (prevLevelStart.left.left != null || prevLevelStart.left.right != null)) { return prevLevelStart.left; } else if (prevLevelStart.right != null && (prevLevelStart.right.left != null || prevLevelStart.right.right != null)) { return prevLevelStart.right; } else { prevLevelStart = prevLevelStart.next; } } return null; } }
117. Populating Next Right Pointers in Each Node II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。