【LeetCode】LeetCode 102.二叉树的层序遍历

LeetCode 102.二叉树的层序遍历

题目链接：https://leetcode.cn/problems/binary-tree-inorder-traversal/submissions/

题目

解答

使用队列、广度优先遍历

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        queue<TreeNode*> que;
        if(root != NULL)    que.push(root);
        vector<vector<int>> result;
        while(!que.empty()){
            int size = que.size();
            vector<int> vec;
            for(int i = 0 ; i < size ; i++ ){
                TreeNode* node = que.front();
                que.pop();
                vec.push_back(node->val);
                if(node->left)   que.push(node->left);
                if(node->right)  que.push(node->right);
            }
            result.push_back(vec);
        }
        return result;
    }
};