struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
1、常规层次遍历
2、变体1:每层的节点存到一个vector中,102. 二叉树的层序遍历
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
std::queue<TreeNode*> queue; //层序遍历用队列
if (root == NULL) return res;
queue.push(root); //将根节点加入队列
while (queue.size() > 0) {
res.push_back(vector<int>());
int n = queue.size(); //重点,获取tree每一层的节点个数
for (int i = 0; i < n; i++) { //处理每一层的节点数
TreeNode* cur = queue.front();
queue.pop();
res.back().push_back(cur->val);
if (cur->left) queue.push(cur->left);
if (cur->right) queue.push(cur->right);
}
}
return res;
}
3、变体2:锯齿形逐层输出 ,103. 二叉树的锯齿形层次遍历
4、变体4:从树底向上输出,107. 二叉树的层次遍历 II