首页 > 代码库 > [leetcode] Populating Next Right Pointers in Each Node
[leetcode] Populating Next Right Pointers in Each Node
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
https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/
思路:关键是5跟6如何连接,用递归的做法,把当前root的左节点和它所有后继右节点 与 右节点和所有深度的左节点连接。
public class Solution { public void connect(TreeLinkNode root) { if(root==null) return; if(root.left!=null){ TreeLinkNode l = root.left; TreeLinkNode r = root.right; while(l!=null){ l.next=r; l=l.right; r=r.left; } } connect(root.left); connect(root.right); }}
参考:
http://blog.csdn.net/havenoidea/article/details/12840497
http://blog.csdn.net/fightforyourdream/article/details/14514165
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。