102. Binary Tree Level Order Traversal.md

102. Binary Tree Level Order Traversal

思路

层序遍历二叉树。已经在107题题解分析过了。

时空复杂度均O(n)

C++

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>>res;
        if(root == NULL) return res;
        queue<TreeNode *>q;
        TreeNode *p;
        
        q.push(root);
        while(!q.empty()){
            vector<int>level;
            for(int i = q.size(); i > 0; i--){
                p = q.front();
                q.pop();
                level.push_back(p -> val);
                if(p -> left) q.push(p -> left);
                if(p -> right) q.push(p -> right);
            }
            res.push_back(level);
        }
        return res;
    }
};