LeetCode Populating Next Right Pointers in Each Node
来源:互联网 发布:papi酱起诉被驳回知乎 编辑:程序博客网 时间:2024/06/09 23:38
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 to NULL
.
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内容:将一棵完美二叉树的每一层都串起来。
思路:关键是读懂题意:如果左孩子为空,则右孩子一定为空,所以左孩子为空,则return;如果左孩子不为空,则右孩子一定不为空,那么我们就可以直接连接左右儿子。
/** * 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 || root.left == 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); }}
0 0
- 【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 78: 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
- iOS8 tableview separatorInset cell分割线左对齐,ios7的方法失效了
- Swift-元组tuple
- 文件存储的实现-login登录案例1-内置存储
- Jforum使用FCKeditor的两种方法
- MySQL hash索引和btree索引的区别
- LeetCode Populating Next Right Pointers in Each Node
- eclipse自动提示卡死情况处理
- 入驻新家了,大家欢迎一下我吧!
- 父类方法与接口方法同名初探
- XML和HTML解析
- Python读unicode文件
- [leetCode] Combination Sum
- 精度计算-大数阶乘
- Lrucache浅析