leetcode117. 填充每个节点的下一个右侧节点指针 II

题目描述

给定一个二叉树

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}
填充它的每个 next 指针，让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点，则将 next 指针设置为 NULL。

初始状态下，所有 next 指针都被设置为 NULL。

 

示例

输入：{"$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":null,"next":null,"right":{"$id":"6","left":null,"next":null,"right":null,"val":7},"val":3},"val":1}

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

解释：给定二叉树如图 A 所示，你的函数应该填充它的每个 next 指针，以指向其下一个右侧节点，如图 B 所示。

 

思路

这题较上题有明显不同leetcode116. 填充每个节点的下一个右侧节点指针。

因为其是普通得二叉树，所以左结点得next节点不一定是其父节点得右节点，右节点得next节点不一定是父结点next节点得左结点。这些都需要判断。

最大的坑在：要先解决右子树，在解决左子树。因为先解决左子树则右子树得next信息获取不全，这个地方折腾我好久。。。

 

代码

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

    Node() {}

    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) return root;
        if (root->left) {
            if (root->right)
                root->left->next = root->right;
            else if (root->next){
                auto tmp = root->next;
                while (tmp){
                    if (tmp->left){
                        root->left->next = tmp->left;
                        break;
                    }
                    else if(tmp->right){
                        root->left->next = tmp->right;
                        break;
                    }
                    else tmp = tmp->next;
                }
            }
        }
        if (root->next && root->right) {
            auto tmp = root->next;
            while (tmp){
                if (tmp->left) {
                    root->right->next = tmp->left;
                    break;
                }
                else if (tmp->right) {
                    root->right->next = tmp->right;
                    break;
                }
                else tmp = tmp->next;
            }
        }
     
        if (root->right) connect(root->right);
        if (root->left) connect(root->left);
        return root;
    }
};