算法：Binary Tree Level Order Traversal

最新推荐文章于 2024-02-12 01:19:39 发布

NicolasYan

最新推荐文章于 2024-02-12 01:19:39 发布

阅读量454

点赞数

分类专栏：算法 C++ 文章标签：算法 LeetCode

本文链接：https://blog.csdn.net/NicolasYan/article/details/52524020

版权

算法同时被 2 个专栏收录

24 篇文章 0 订阅

订阅专栏

C++

13 篇文章 0 订阅

订阅专栏

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \

15 7

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> levelHolder;
        
        if(root==NULL)
            return levelHolder;
            
        vector<int>* aLvl = new vector<int>();
        deque<TreeNode*> Q;
        Q.push_back(root);
        Q.push_back(NULL);
        
        while(!Q.empty())
        {
            TreeNode *n = Q.front();
            Q.pop_front();
            
            if(n!=NULL)
            {
                aLvl->push_back(n->val);
                
                if(n->left!=NULL)
                    Q.push_back(n->left);
                if(n->right!=NULL)
                    Q.push_back(n->right);
            }
            else
            {
                levelHolder.push_back(*aLvl);
                aLvl = new vector<int>();
                Q.push_back(NULL);
            }
            
            if(n==NULL && Q.size()==1)
                break;
        }
        
        return levelHolder;
    }
};