117. Populating Next Right Pointers in Each Node II
2018-01-18 00:00
253 查看
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
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
/** * 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) { if (root == null){ return ; } ArrayDeque<TreeLinkNode> que = new ArrayDeque<>(); que.offer(root); int size = 0; while (!que.isEmpty()){ size = que.size(); TreeLinkNode tmp; TreeLinkNode pre = null; for (int i = 0; i < size; ++ i){ tmp = que.poll(); if (tmp.left != null){ que.offer(tmp.left); } if (tmp.right != null){ que.offer(tmp.right); } 4000 if (pre != null){ pre.next = tmp; } pre = tmp; } } } }
相关文章推荐
- 117. Populating Next Right Pointers in Each Node II
- leetcode 117 —— Populating Next Right Pointers in Each Node II
- leetcode_117_Populating Next Right Pointers in Each Node II
- LeetCode(117) Populating Next Right Pointers in Each Node II
- LeetCode 117 Populating Next Right Pointers in Each Node II
- 117:Populating Next Right Pointers in Each Node II【树】【DFS】
- LeetCode117—Populating Next Right Pointers in Each Node II
- [leetcode-117]Populating Next Right Pointers in Each Node II(c++)
- LeetCode力扣之117. Populating Next Right Pointers in Each Node II
- [LeetCode]题解(python):117-Populating Next Right Pointers in Each Node II
- LeetCode 117 Populating Next Right Pointers in Each Node II
- leetcode[117]Populating Next Right Pointers in Each Node II
- 117. Populating Next Right Pointers in Each Node II
- 117. Populating Next Right Pointers in Each Node II
- LeetCode 117 Populating Next Right Pointers in Each Node II (链表 层次遍历 推荐)
- [Leetcode 117, Hard] Populating Next Right Pointers in Each Node II
- Java for LeetCode 117 Populating Next Right Pointers in Each Node II
- 117. Populating Next Right Pointers in Each Node II
- 117. Populating Next Right Pointers in Each Node II
- 117. Populating Next Right Pointers in Each Node II Leetcode Python