[LeetCode] Populating Next Right Pointers in Each Node I &II

最新推荐文章于 2024-09-14 18:52:56 发布

sinat_17052287

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量312

点赞数

文章标签： leetcode 二叉树

本文链接：https://blog.csdn.net/sinat_17052287/article/details/36185517

版权

I 是满二叉树，II 是任意二叉树

I是每层处理完接着处理root的left和right结点。

II也是逐层处理。每层有两个辅助的node来记住每层第一个出现的节点和当前处理到的结点

Populating Next Right Pointers in Each Node I

Populating Next Right Pointers in Each Node II

/**
 * Definition for binary tree with next pointer.
 * struct TreeLinkNode {
 *  int val;
 *  TreeLinkNode *left, *right, *next;
 *  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
 * };
 */
class Solution {
public:
    void connect(TreeLinkNode *root) {
        if(root == NULL) return;
        while(root->left == NULL && root->right == NULL)
        {
            if(root->next == NULL)
            return;
            else
            root = root->next;
        }
        TreeLinkNode *start;
        TreeLinkNode *cur;
        if(root->left!= NULL)
        {
            
            cur = root->left;
            start = cur;
            if(root->right!= NULL)
            {
                cur->next = root->right;
                cur = cur->next;
            }
        }
        else if(root->left == NULL && root->right!= NULL)
        {
            cur = root->right;
            start = cur;
        }
        while(root->next!= NULL)
        {
            root = root->next;
            if(root->left == NULL && root->right == NULL) {
                continue;
            }
            if(root->left != NULL)
            {
                cur->next = root->left;
                cur = cur->next;
            }
            if(root->right != NULL)
            {
                cur->next = root->right;
                cur = cur->next;
            }
        }
        connect(start);
        return;
    }
};