【LeetCode】116.Populating Next Right Pointers in Each Node(Medium)解题报告-CSDN博客

本文提供LeetCode第116题“填充每个节点的下一个右侧节点指针”的两种解决方案，包括先序遍历和层序遍历的方法。这两种方法均实现了在完美二叉树中设置每个节点的next指针指向其右侧相邻节点的功能。

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

【LeetCode】116.Populating Next Right Pointers in Each Node(Medium)解题报告

题目地址：https://leetcode.com/problems/populating-next-right-pointers-in-each-node/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.
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

第一种不符合要求，第二种正确

Solution1:

/**
 * Definition for binary tree with next pointer.
 * public class TreeLinkNode {
 *     int val;
 *     TreeLinkNode left, right, next;
 *     TreeLinkNode(int x) { val = x; }
 * }
 两种写法，先序遍历
 很重要的一道题
 time : O(n)
 space : O(n)
 */
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 != null){
            root.right.next = root.next.left;
        }
        connect(root.left);
        connect(root.right);
    }
}

Solution2:

/**
 * Definition for binary tree with next pointer.
 * public class TreeLinkNode {
 *     int val;
 *     TreeLinkNode left, right, next;
 *     TreeLinkNode(int x) { val = x; }
 * }
 两种写法，层序遍历
 很重要的一道题
 time : O(n)
 space : O(1)
 */
public class Solution {
    public void connect(TreeLinkNode root) {
        if(root == null) return;
        TreeLinkNode start = root;
        while(start != null){
            TreeLinkNode cur = start;
            while(cur != null){
                if(cur.left != null){
                    cur.left.next = cur.right;
                }
                if(cur.next != null && cur.right != null){
                    cur.right.next = cur.next.left;
                }
                cur = cur.next;
            }
            start = start.left;
        }
    }
}