116. Populating Next Right Pointers in Each Node
Posted 张乐乐章
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了116. 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
1 public class Solution { 2 public void connect(TreeLinkNode root) { 3 TreeLinkNode level_start=root; 4 while(level_start!=null){ 5 TreeLinkNode cur=level_start; 6 while(cur!=null){ 7 if(cur.left!=null) cur.left.next=cur.right; 8 if(cur.right!=null && cur.next!=null) cur.right.next=cur.next.left; 9 10 cur=cur.next; 11 } 12 level_start=level_start.left; 13 } 14 } 15 }
以上是关于116. Populating Next Right Pointers in Each Node的主要内容,如果未能解决你的问题,请参考以下文章