leetcode Populating Next Right Pointers in Each Node题解

最新推荐文章于 2023-11-09 13:05:39 发布

leo_weile

最新推荐文章于 2023-11-09 13:05:39 发布

阅读量124

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/leo_weile/article/details/90711395

版权

leetcode 专栏收录该内容

162 篇文章 0 订阅

订阅专栏

题目描述：

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *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.

Example:

Input: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":null,"right":null,"val":4},"next":null,"right":{"$id":"4","left":null,"next":null,"right":null,"val":5},"val":2},"next":null,"right":{"$id":"5","left":{"$id":"6","left":null,"next":null,"right":null,"val":6},"next":null,"right":{"$id":"7","left":null,"next":null,"right":null,"val":7},"val":3},"val":1}

Output: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":{"$id":"4","left":null,"next":{"$id":"5","left":null,"next":{"$id":"6","left":null,"next":null,"right":null,"val":7},"right":null,"val":6},"right":null,"val":5},"right":null,"val":4},"next":{"$id":"7","left":{"$ref":"5"},"next":null,"right":{"$ref":"6"},"val":3},"right":{"$ref":"4"},"val":2},"next":null,"right":{"$ref":"7"},"val":1}

Explanation: Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B.

中文理解：

新定义的多叉树，带有三个指针，left，right和next，next指针指向同层的右边一个节点，不过初始时next为null，现在将所有next指针补齐。

解题思路：

层次遍历二叉树，得到每一层的节点序列，然后逐层将next指针补齐。

代码（java）：

/*
// Definition for a Node.
class Node {
    public int val;
    public Node left;
    public Node right;
    public Node next;

    public Node() {}

    public Node(int _val,Node _left,Node _right,Node _next) {
        val = _val;
        left = _left;
        right = _right;
        next = _next;
    }
};
*/
class Solution {
    public Node connect(Node root) {
        if(root==null)return root;
        List<List<Node>> list=new ArrayList();
        bfs(list,root,0);
        for(int i=0;i<list.size();i++){
            for(int j=0;j<list.get(i).size()-1;j++){
                list.get(i).get(j).next=list.get(i).get(j+1);
            }
        }
        return root;
    }
    
    public void bfs(List<List<Node>> list,Node root,int level){
        if(root==null)return;
        if(level>list.size()-1){
            List<Node> temp=new ArrayList();
            temp.add(root);
            list.add(new ArrayList(temp));
        }
        else{
            List<Node> temp=list.get(level);
            temp.add(root);
        }
        bfs(list,root.left,level+1);
        bfs(list,root.right,level+1);
    }
}