LeetCode 36 Populating Next Right Pointers in Each Node

最新推荐文章于 2025-08-13 21:50:19 发布

原创最新推荐文章于 2025-08-13 21:50:19 发布 · 778 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #二叉树 #层指针

LeetCode 专栏收录该内容

151 篇文章

订阅专栏

本文详细介绍了如何使用常量额外空间填充完美二叉树中每个节点的next指针，实现相邻节点间的链接。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

1, You may only use constant extra space.

2, 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

分析：

维护上下两层，每次通过上层和下层的父子关系，建立向右的指针。

/**
 * 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;
        
        TreeLinkNode above = root;
        TreeLinkNode first = root.left;
        
        while(above != null && above.left !=null){
            
            while(above != null){
                TreeLinkNode curr = above.left;
                curr.next = above.right;
                curr = curr.next;
                above = above.next;
                curr.next = (above==null)? null : above.left;
            }
            above = first;
            first = (above==null)? null : above.left;
            
        }
    }
}