116-Populating Next Right Pointers in Each Node

最新推荐文章于 2025-08-07 20:58:17 发布

kevin聪

最新推荐文章于 2025-08-07 20:58:17 发布

阅读量195

点赞数

CC 4.0 BY-SA版权

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/80449376

算法与数据结构同时被 2 个专栏收录

569 篇文章

订阅专栏

leetcode

557 篇文章

订阅专栏

本文介绍如何在完美二叉树中填充每个节点的next指针，使其指向右节点，若无则置null。提供了三种不同的解决方案，包括迭代、递归及先序遍历的方法。

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

Description

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.
Recursive approach is fine, implicit stack space does not count as extra space for this problem.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

Example:

Given the following perfect binary tree,

After calling your function, the tree should look like:

     1 -> NULL
   /  \
  2 -> 3 -> NULL
 / \  / \
4->5->6->7 -> NULL

问题描述

二叉树中节点的结构如下

struct TreeLinkNode {
  TreeLinkNode *left;
  TreeLinkNode *right;
  TreeLinkNode *next;
}

将next指向右边的节点。如果某节点无右边节点， next置为null

问题分析

解法1

public class Solution {
    public void connect(TreeLinkNode root) {
        TreeLinkNode level_start = root;

        while(level_start != null){
            TreeLinkNode cur = level_start;
            while(cur != null){
                if(cur.left != null)    cur.left.next = cur.right;
                if(cur.right != null && cur.next != null)   cur.right.next = cur.next.left;
                cur = cur.next;
            }
            level_start = level_start.left;
        }
    }
}

解法2

public class Solution {
    public void connect(TreeLinkNode root) {
        if(root == null) return;

        List<TreeLinkNode> res = new ArrayList<TreeLinkNode>();
        connectFunc(root, res, 0);
    }
    public void connectFunc(TreeLinkNode root, List<TreeLinkNode> res, int height){
        if(root == null) return;

        if(height == res.size()) res.add(root);
        else{
            res.get(height).next = root;
            res.set(height,root);
        }

        connectFunc(root.left, res, height + 1);
        connectFunc(root.right, res, height + 1);
    }
}

解法3

public class Solution {
    public void connect(TreeLinkNode root) {
        if(root == null)    return;
        if(root.left != null){
            root.left.next = root.right;
            if(root.next != null)   root.right.next = root.next.left;
        }

        connect(root.left);
        connect(root.right);
    }
}