populating-next-right-pointers-in-each-node Java code
来源:互联网 发布:从程序员到架构师之路 编辑:程序博客网 时间:2024/05/22 07:00
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
/** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */import java.util.LinkedList;import java.util.Queue;public class Solution { public void connect(TreeLinkNode root) { if(root == null) return; Queue<TreeLinkNode> queue = new LinkedList<>(); queue.offer(root); while(!queue.isEmpty()){ int len = queue.size(); for(int i = 0; i < len; i++){ TreeLinkNode tmp = queue.poll(); if(i == len - 1){ tmp.next = null; }else { tmp.next = queue.peek(); } if(tmp.left != null) queue.offer(tmp.left); if(tmp.right != null) queue.offer(tmp.right); } } }}
阅读全文
0 0
- populating-next-right-pointers-in-each-node Java code
- populating-next-right-pointers-in-each-node Java code
- CODE 17: Populating Next Right Pointers in Each Node
- CODE 16: Populating Next Right Pointers in Each Node II
- [leet code] Populating Next Right Pointers in Each Node
- [leet code] Populating Next Right Pointers in Each Node II
- 【Leetcode】Populating Next Right Pointers in Each Node in JAVA
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- 解决动态创建的Combobox出现绑定的DataSource丢失的问题
- 解救安卓异常——jar冲突,jar包重复
- 阿里云(天津)生态与技术合作论坛 2017年11月1日·天津
- jvm五大区及作用学习总结
- angular之用户表
- populating-next-right-pointers-in-each-node Java code
- AndroidKiller高版本反编译失败解决
- struts2通配符
- dubbo+ zookeeper 简单环境搭建 (主体为dubbo)
- Spark Streaming自定义数据源-实现自定义输入DStream和接收器
- JavaScript全排列的六种算法 具体实现
- Oracle表空间的使用情况查询
- C# HttpWebRequest使用GET、POST请求获取结果
- bluebird之catch