void CengOrder(TreeNode* root,vector<vector<int>>& res) {
if (root == nullptr) return;
queue<TreeNode*> q;
q.push(root);
while (!q.empty())
{
int cursize = q.size();
res.push_back(vector<int>());
for (int i = 0; i < cursize; i++) {
TreeNode* node = q.front();
q.pop();
res.back().push_back(node->val);
if (node->left) q.push(node->left);
if (node->right) q.push(node->right);
}
}
}
二叉树层序遍历
vector<vecor> 存储每层的数据的vector
queue 首先跟节点入队;父点出队的同时子节点入队