题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
思路:
参考二叉树的递归与非递归遍历(前序、中序、后序、层序)
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
vector<int> PrintFromTopToBottom(TreeNode* root) {
vector<int> result;
if(root == NULL)
return result;
mQueue.push(root);
while(!mQueue.empty()){
TreeNode* temp = mQueue.front();
result.push_back(temp->val);
mQueue.pop();
if(temp->left)
mQueue.push(temp->left);
if(temp->right)
mQueue.push(temp->right);
}
return result;
}
private:
queue<TreeNode*> mQueue;
};