剑指 Offer 32 - I. 从上到下打印二叉树 - 力扣(LeetCode) (leetcode-cn.com)
运行结果
代码(没有注释,不难理解)
class Solution {
public:
vector<int> levelOrder(TreeNode* root) {
vector<int> arr;
if (!root) return arr;
deque<TreeNode*> nodeDeque;
nodeDeque.push_back(root);
while (!nodeDeque.empty()) {
root = nodeDeque.front(); nodeDeque.pop_front();
arr.push_back(root->val);
if (root->left) nodeDeque.push_back(root->left);
if (root->right) nodeDeque.push_back(root->right);
}
return arr;
}
};