方法一:使用队列存储每层的节点
时间复杂度O(N),空间复杂度O(N)
class Solution {
public:
vector<vector<int>> result;
queue<TreeNode*> nodes;
vector<vector<int>> levelOrder(TreeNode* root) {
if(!root) return {};
nodes.push(root);
int size = 1;
while(!nodes.empty()){
vector<int> temp;
for(int i = 0;i<size;i++){
auto node = nodes.front();
nodes.pop();
temp.push_back(node->val);
if(node->left) nodes.push(node->left);
if(node->right) nodes.push(node->right);
}
result.push_back(temp);
size = nodes.size();
}
return result;
}
};