#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<cstring>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<limits.h>
#include<assert.h>
#include<sstream>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
/*
class Solution {
struct Node
{
int flag;
TreeNode* r;
};
public:
vector< vector<int> > levelOrder(TreeNode* root) {
vector< vector<int> > res;
if(!root) return res;
///res[0].push_back(root->val);
queue<Node&g
leetcode+二叉树层次遍历+二维vector使用
最新推荐文章于 2022-07-29 10:57:03 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)