[LeetCode72]Populating Next Right Pointers in Each Node

二叉树节点连接实现

最新推荐文章于 2025-11-24 01:23:29 发布

原创最新推荐文章于 2025-11-24 01:23:29 发布 · 797 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #binary tree

Leetcode 同时被 2 个专栏收录

287 篇文章

订阅专栏

LeetCode Questions

178 篇文章

订阅专栏

本文介绍了一种常量额外空间复杂度下填充二叉树节点连接的方法，确保每个节点的next指针指向其右侧相邻节点，适用于完美二叉树。

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

Analysis:

当前层处理完next指针的连接以后，再调用下一级节点。

Java

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

c++

void connect(TreeLinkNode *root) {
     if(root == NULL) return;
     if(root->left != NULL)
        root->left->next = root->right;
     if(root->right != NULL)
        root->right->next = root->next ? root->next->left:NULL;
     connect(root->left);
     connect(root->right);
}