从上到下打印出二叉树的每个节点,同一层的节点按照从左到右的顺序打印。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回:
[3,9,20,15,7]
提示:
节点总数 <= 1000
通过次数1,281提交次数1,930
这题做过,没什么说的。
#include <iostream>
#include <queue>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
vector<int> levelOrder(TreeNode* root) {
if(root){
m_queue.push(root);
}
while(!m_queue.empty()){
TreeNode *front = m_queue.front();
m_res.push_back(front->val);
m_queue.pop();
if(front->left){
m_queue.push(front->left);
}
if(front->right){
m_queue.push(front->right);
}
}
return m_res;
}
private:
vector<int> m_res;
queue<TreeNode *>m_queue;
};