LeetCode-Populating Next Right Pointers in Each Node

最新推荐文章于 2021-09-24 12:05:40 发布

原创最新推荐文章于 2021-09-24 12:05:40 发布 · 292 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Populating Next Righ

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

Tree

26 篇文章

订阅专栏

本文介绍了一种在完美二叉树中填充每个节点的next指针的方法，使得每个节点的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:

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,

After calling your function, the tree should look like:

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

Solution:

Code:

<span style="font-size:14px;">/**
 * 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) {
        if (!root || !root->left) return;
        root->left->next = root->right;
        if (root->next) root->right->next = root->next->left;
        connect(root->right);
        connect(root->left);
    }
};</span>