LeetCode_populating-next-right-pointers-in-each-node

最新推荐文章于 2018-07-19 10:38:02 发布

wulinsam

最新推荐文章于 2018-07-19 10:38:02 发布

阅读量360

点赞数

本文链接：https://blog.csdn.net/Lyn12030706/article/details/48272011

版权

原题链接：https://leetcode.com/problems/populating-next-right-pointers-in-each-node/

class Solution {
public:
    void connect(TreeLinkNode *root) {
        queue<TreeLinkNode* > que1,que2;
        TreeLinkNode *pre;
        pre = NULL;
        if(root)
        {
            que1.push(root);
            while(!que1.empty() || !que2.empty())
            {
                while(!que1.empty())
                {
                    root = que1.front();
                    que1.pop();
                    if(pre)
                        pre->next = root;
                        
                    if(root->left)
                        que2.push(root->left);
                    if(root->right)
                        que2.push(root->right);
                    pre = root;
                }
                root->next = NULL;
                pre = NULL;
                
                while(!que2.empty())
                {
                    root = que2.front();
                    que2.pop();
                    if(pre)
                        pre->next = root;
                        
                    if(root->left)
                        que1.push(root->left);
                    if(root->right)
                        que1.push(root->right);
                    pre = root;
                }
                root->next = NULL;
                pre = NULL;//注意不能遗漏
            }
        }
    }
};