0
点赞
收藏
分享

微信扫一扫

剑指 Offer 32. 从上到下打印二叉树

剑指 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;
    }
};
举报

相关推荐

0 条评论