题目描述:
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
题目分析:
二叉树层次遍历,需要辅助队列。
class Solution {
public:
vector<int> PrintFromTopToBottom(TreeNode* root) {
vector<int> ret;
queue<TreeNode *> que;
if (root == NULL)
return ret;
que.push(root);
while (!que.empty()) {
TreeNode *cur = que.front();
que.pop();
ret.push_back(cur->val);
if (cur->left)
que.push(cur->left);
if (cur->right)
que.push(cur->right);
}
return ret;
}
};