leetcode 78: Populating Next Right Pointers in Each Node
来源:互联网 发布:join java 编辑:程序博客网 时间:2024/04/28 23:31
Populating Next Right Pointers in Each NodeOct 28 '12
Given a binary tree
struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set toNULL
.
Initially, all next pointers are set to NULL
.
Note:
- You may only use constant extra space.
- You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1 / \ 2 3 / \ / \ 4 5 6 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ / \ 4->5->6->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; if(root.left!=null) { root.left.next = root.right; if(root.next!=null) root.right.next = root.next.left; connect(root.left); connect(root.right); } }}
/** * 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) { // Start typing your Java solution below // DO NOT write main() function if(root==null) return; root.next = null; nextRec(root.left, root.right); nextRec(root.right, null); return; } private void nextRec(TreeLinkNode root, TreeLinkNode next) { if(root==null) return; root.next = next; nextRec(root.left, root.right); if(next!=null) nextRec(root.right, next.left); else nextRec(root.right, null); }}
- leetcode 78: Populating Next Right Pointers in Each Node
- 【LeetCode】Populating Next Right Pointers in Each Node Populating Next Right Pointers in Each Node II
- leetcode Populating Next Right Pointers in Each Node &&Populating Next Right Pointers in Each Node||
- LeetCode Populating Next Right Pointers in Each Node & Populating Next Right Pointers in Each Node I
- 【Leetcode】Populating Next Right Pointers in Each Node in JAVA
- LeetCode Populating Next Right Pointers in Each Node
- LeetCode Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node
- LeetCode: Populating Next Right Pointers in Each Node
- [Leetcode] Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node
- [LeetCode] Populating Next Right Pointers in Each Node II
- 【leetcode】 Populating Next Right Pointers in Each Node
- leetcode 79: Populating Next Right Pointers in Each Node II
- Leetcode: Populating Next Right Pointers in Each Node
- [Leetcode] Populating Next Right Pointers in Each Node ii
- leetcode Populating Next Right Pointers in Each Node II
- 【leetcode】Populating Next Right Pointers in Each Node
- iOS设备踢出恢复模式的几种方法
- 2013年2月17日,新的开始!
- C++如何获取文件属性
- 杂感
- Android Activity生命周期管理
- leetcode 78: Populating Next Right Pointers in Each Node
- linux 开机自动启动 tomcat
- 2013寒假练习 1063 食物链(另1062 Find them, Catch them,1061 Ubiquitous Religions)
- 阿里云学习九 - 弹性计算:云服务器 & 负载均衡
- 浅谈PHP可变变量安全续续
- 2012年提高班学习总结
- 实现“点子”的能力
- 二叉树常见运算问题
- JFIF格式的Jpeg属性读取