[leetcode] 116. Populating Next Right Pointers in Each Node

最新推荐文章于 2023-11-09 13:02:00 发布

bugMaker_Anna

最新推荐文章于 2023-11-09 13:02:00 发布

阅读量133

点赞数

分类专栏： leetcode 文章标签： leetcode c++ binary tree

本文链接：https://blog.csdn.net/annazzz/article/details/98077344

版权

leetcode 专栏收录该内容

30 篇文章

订阅专栏

116. Populating Next Right Pointers in Each Node

Description
Analysis
Code

Description

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: {“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots":"1","left":{"$ id”:“2”,“left”:{“ $KaTeX parse error: Expected 'EOF', got '}' at position 53: \dotst":null,"val":4}̲,"next":null,"r\dots$ id”:“4”,“left”:null,“next”:null,“right”:null,“val”:5},“val”:2},“next”:null,“right”:{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots":"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: {“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots":"1","left":{"$ id”:“2”,“left”:{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots:null,"next":{"$ id”:“4”,“left”:null,“next”:{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots: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”:{“ $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots":"7","left":{"$ ref”:“5”},“next”:null,“right”:{“ $KaTeX parse error: Expected 'EOF', got '}' at position 9: ref":"6"}̲,"val":3},"righ\dots$ 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.

Note:

You may only use constant extra space.
Recursive approach is fine, implicit stack space does not count as extra space for this problem.

Analysis

此题考查的是二叉树的广度优先搜索，遍历的同时连接节点的next指针。有三种方法：传统的递归、非递归，还有不使用queue的非递归方法。
在第三种方法中，设置两个指针start和cur，start指向每层最左节点，cur用于遍历该层所有节点，并连接下一层的next指针。

Code

递归

class Solution {
public:
    //1. 递归方法
    Node* connect(Node* root) {
        if(!root)   return NULL;
        if(root->left)  root->left->next = root->right;
        if(root->right) root->right->next = root->next==NULL? NULL:root->next->left;
        connect(root->left);
        connect(root->right);
        
        return root;
    }
}

传统非递归

class Solution {
public:
    Node* connect(Node* root){
        if(!root)   return NULL;
        queue<Node*> que;
        Node* p = root;
        que.push(p);
        
        while(!que.empty()){
            p = que.front();
            que.pop();
            if(p->left){
                p->left->next = p->right;
                que.push(p->left);
            }
            if(p->right){
                p->right->next = p->next? p->next->left:NULL;
                que.push(p->right);
            }
        }
        
        return root;
    }
}

不使用队列的非递归

class Solution {
public:
Node* connect(Node* root){
        if(!root)
            return NULL;
        Node* start = root;
        Node* cur = start;
        
        while(start){
            cur = start;
            while(cur){
                if(cur->left)
                    cur->left->next = cur->right;
                if(cur->right)
                    cur->right->next = cur->next? cur->next->left:NULL;
                cur = cur->next;
            }
            start = start->left;
        }
        return root;
    }
};