Leetcode Populating Next Right Pointers in Each Node
来源:互联网 发布:iphone蜂窝数据用户名 编辑:程序博客网 时间:2024/06/13 11:42
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
Difficulty: Medium
/** * 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 helper(TreeLinkNode left, TreeLinkNode right){ if(left == null) return; left.next = right; helper(left.left, left.right); helper(left.right, right.left); helper(right.left, right.right); } public void connect(TreeLinkNode root) { if(root == null) return; helper(root.left, root.right); return; }}
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
- Leetcode Odd Even Linked List
- Leetcode Binary Tree Maximum Path Sum
- IOS控件总是看不见。
- Leetcode Maximal Rectangle
- Leetcode 3Sum Closest
- Leetcode Populating Next Right Pointers in Each Node
- Leetcode Length of Last Word
- Leetcode Multiply Strings
- 关于使用开源库或jar包时可能遇到ndk冲突错误
- 最小点割集
- 连接数据库 in clojure ---korma
- 【日志7.19】
- Learning Python 010 函数 1
- 关于mysql存储过程的definer的问题