Populating Next Right Pointers in Each Node

本文详细介绍了如何使用常数额外空间来填充完美二叉树中每个节点的 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 toNULL.

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

思路: 就是主要连接两个,一个是root.left != NULL,  root.right != null ,左边节点往右,右边节点往右,然后root往后挪动,当前层连接完了,root变成firstNode.left;

class Solution {
    public Node connect(Node root) {
        if(root == null) {
            return null;
        }
        Node head = root;
        while(root != null) {
            Node firstNode = root;
            while(root != null) {
                if(root.left != null) {
                    root.left.next = root.right;
                }
                if(root.right != null && root.next != null) {
                    root.right.next = root.next.left;
                }
                root = root.next;
            }
            root = firstNode.left;
        }
        return head;
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值