vector的嵌套,保留一下,平常用的不多。
思路不难,至于层序的话,多加一个for循环,用len来计算一下当前层数的结点数。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
queue<TreeNode*> Q;
vector<vector<int>> v;
if(root!=NULL){
Q.push(root);
}
while(!Q.empty()){
int len=Q.size();
vector<int> m;
for(int i=1;i<=len;i++){
TreeNode* T=Q.front();
Q.pop();
m.push_back(T->val);
if(T->left!=NULL){
Q.push(T->left);
}
if(T->right!=NULL){
Q.push(T->right);
}
}
v.push_back(m);
}
return v;
}
};