Leetcode 117. Populating Next Right Pointers in Each Node II
来源:互联网 发布:药店时空软件官网 编辑:程序博客网 时间:2024/06/05 10:55
Question
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
Code
public void connect(TreeLinkNode root) { if (root == null) { return; } TreeLinkNode leftEnd = root; while (leftEnd != null) { TreeLinkNode cur = leftEnd; TreeLinkNode dummy = new TreeLinkNode(0); TreeLinkNode pre = dummy; while (cur != null) { if (cur.left != null) { pre.next = cur.left; pre = cur.left; } if (cur.right != null) { pre.next = cur.right; pre = cur.right; } cur = cur.next; } leftEnd = dummy.next; } }
0 0
- 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
- [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
- 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
- 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
- [LeetCode] 117. Populating Next Right Pointers in Each Node II
- LeetCode#117. Populating Next Right Pointers in Each Node II
- 新的开始
- linux设置网络传输包mtu
- 逆向工程实战分享
- [bzoj4454]C Language Practice 解题报告
- EditText光标位置的改变
- Leetcode 117. Populating Next Right Pointers in Each Node II
- PHP:微信公众号的红包发送功能
- 代码篇——DataGrid
- 观察观察观察
- SA模板
- 碰撞检测之OBB-OBB的SweepTest
- 重建二叉树
- 二、初学SpringMVC+Mybatis之Spring IOC
- RDD弹性分布式数据集(一)