116. Populating Next Right Pointers in Each Node
2016-10-11 08:34
495 查看
Given a binary tree
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
Initially, all next pointers are set to
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,
After calling your function, the tree should look like:
Hide Company Tags
Microsoft
Show Tags
Show Similar Problems
perfect 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
Hide Company Tags
Microsoft
Show Tags
Show Similar Problems
perfect tree 完全二叉树,左右子树都有
/** * 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.right != null) root.right.next = root.next == null ? null: root.next.left; connect(root.left); connect(root.right); } }
相关文章推荐
- 116. Populating Next Right Pointers in Each Node
- leetcode-java-116. Populating Next Right Pointers in Each Node
- FTPrep, 116 Populating Next Right Pointers in Each Node, TODO,再多code几遍,虽然总结写得还比较ok,但是还是手感不熟
- 116. Populating Next Right Pointers in Each Node
- [Leetcode 116, Medium] Populating Next Right Pointers in Each Node
- LeetCode 116. Populating Next Right Pointers in Each Node
- 116.Populating Next Right Pointers in Each Node(二叉完全树的next结点)
- Populating Next Right Pointers in Each Node - LeetCode 116
- LeetCode(116) Populating Next Right Pointers in Each Node
- leetcode_middle_63_116. Populating Next Right Pointers in Each Node
- [LeeCode]116. Populating Next Right Pointers in Each Node
- [LeetCode]problem 116. Populating Next Right Pointers in Each Node
- LeetCode *** 116. Populating Next Right Pointers in Each Node
- Lettcode_116_Populating Next Right Pointers in Each Node
- LeetCode.116(117) Populating Next Right Pointers in Each Node && II
- LeetCode OJ 116. Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- leetcode 116. Populating Next Right Pointers in Each Node
- leetcode-116. Populating Next Right Pointers in Each Node