102. Binary Tree Level Order Traversal

问题描述

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

return its level order traversal as:

[
[3],
[9,20],
[15,7]
]

题目链接：

---

思路分析

给一棵二叉树，将每一层value保存为一个vector，返回每一层的数据。

使用队列，BFS从root开始，循环输出每一层的结点。

代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        if(!root) return res;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty()){
            vector<int> temp;
            int size = q.size();
            for(int i = 0; i < size; i++){
                temp.push_back(q.front()->val);
                if(q.front()->left) q.push(q.front()->left);
                if(q.front()->right) q.push(q.front()->right);
                q.pop();
            }
            res.push_back(temp);
        }
        return res;
    }
};

时间复杂度：$O(n)$
空间复杂度：$O(n)$

---

反思

二叉树的层序遍历，掌握了队列的使用就会很简单。