[leetcode] 117. Populating Next Right Pointers in Each Node II 解题报告

最新推荐文章于 2025-01-09 10:00:00 发布

小榕流光

最新推荐文章于 2025-01-09 10:00:00 发布

阅读量1.9k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/qq508618087/article/details/50508030

leetcode 同时被 2 个专栏收录

404 篇文章

订阅专栏

binary tree

44 篇文章

订阅专栏

本文讨论了LeetCode中关于填充每个节点的下一个右侧节点指针的二叉树问题的后续挑战。文章详细介绍了如何在不使用额外空间的情况下解决这个问题，并提供了代码实现。

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

题目链接：https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/

Follow up for problem "Populating Next Right Pointers in Each Node".

What if the given tree could be any binary tree? Would your previous solution still work?

Note:

You may only use constant extra space.

For example,
Given the following binary tree,

After calling your function, the tree should look like:

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

思路：可以利用一个虚头结点，记录要连接指针一层结点的第一个元素，然后一个指针从左到右依次连接上一层结点的左右结点。做这一题的时候我又回去看了一下我上一题，发现上一题要求用常量的辅助空间，我用了O(n)的空间。，。正好这个也可以解决那一题的问题。

代码如下：

/**
 * Definition for binary tree with next pointer.
 * struct TreeLinkNode {
 *  int val;
 *  TreeLinkNode *left, *right, *next;
 *  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
 * };
 */
class Solution {
public:
    void connect(TreeLinkNode *root) {
        TreeLinkNode *pHead = new TreeLinkNode(0), *pre = pHead;
        while(root)
        {
            if(root->left)
            {
                pre->next = root->left;
                pre = pre->next;
            }
            if(root->right)
            {
                pre->next = root->right;
                pre = pre->next;
            }
            root = root->next;
            if(!root)//如果到了一层的最后一个结点，就连接下一层的第一个结点
            {
                pre = pHead;
                root = pHead->next;
                pHead->next = NULL;
            }
        }
    }
};

参考：https://leetcode.com/discuss/67291/java-solution-with-constant-space