思路:bfs
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
if (!root) return {};
vector<vector<int>> ans;
queue<TreeNode*> q;
q.push(root);
while (!q.empty()) {
int len = q.size();
vector<int> tmp;
for (int i = 0; i < len ;++i) {
auto frt = q.front();
tmp.push_back(frt->val);
q.pop();
if (frt->left) q.push(frt->left);
if (frt->right) q.push(frt->right);
}
ans.push_back(tmp);
}
return ans;
}
};