思路 套模板,树的层次遍历(BFS),用队列实现
/**
* 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<int> levelOrder(TreeNode* root) {
vector<int> res;
queue<TreeNode*> q;
// 如果是空树,直接返回空列表。否则将根节点入队
if(root==NULL)
return res;
else
q.push(root);
while(!q.empty()){
// 暂存根节点,访问其值后出队。再依次将其左右子结点入队
TreeNode* temp = q.front();
res.push_back(temp->val);
q.pop();
if(temp->left)
q.push(temp->left);
if(temp->right)
q.push(temp->right);
}
return res;
}
};