117-Populating Next Right Pointers in Each Node II

最新推荐文章于 2024-09-18 20:33:32 发布

kevin聪

最新推荐文章于 2024-09-18 20:33:32 发布

阅读量263

点赞数

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/laputafallen/article/details/80451107

版权

算法与数据结构同时被 2 个专栏收录

569 篇文章 0 订阅

订阅专栏

leetcode

557 篇文章 12 订阅

订阅专栏

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.
Recursive approach is fine, implicit stack space does not count as extra space for this problem.

Example:

Given the following binary tree,

After calling your function, the tree should look like:

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

问题描述

给定二叉树的节点结构如下

struct TreeLinkNode {
  TreeLinkNode *left;
  TreeLinkNode *right;
  TreeLinkNode *next;
}

设置next指针指向右边的节点，如果不存在右边的节点，将next设置为空

(这题与116的区别是，树不一定是满二叉树)

问题分析

解法1为这种类型的题目经常用到的一种解法，关键是利用好height

解法2将二叉树的每一层级当作链表给连接起来

解法1

public class Solution {
    public void connect(TreeLinkNode root) {
        if(root == null) return;

        List<TreeLinkNode> res = new ArrayList();
        connectFunc(root, res, 0);
    }
    public void connectFunc(TreeLinkNode root, List<TreeLinkNode> res, int height){
        if(root == null) return;

        if(height == res.size()) res.add(root);
        else{
            res.get(height).next = root;
            res.set(height,root);
        }

        connectFunc(root.left, res, height + 1);
        connectFunc(root.right, res, height + 1);
    }
}

解法2

public class Solution {
    public void connect(TreeLinkNode root) {
        if(root == null) return;

        TreeLinkNode dummyHead = new TreeLinkNode(0);
        TreeLinkNode travel = dummyHead;

        while(root != null){
            if(root.left != null){
                travel.next = root.left;
                travel = travel.next;
            }
            if(root.right != null){
                travel.next = root.right;
                travel = travel.next;
            }
            root = root.next;
        }

        connect(dummyHead.next);
    }
}