树的遍历
- 层次遍历
用队列queue。push一个根节点,弹出根节点并push左右子节点…(队列里现存的节点必然都是同一层的)
当队列为空的时候(queue.empty()==true)整棵树层次遍历完成。
例题
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> levelOrderBottom(TreeNode* root) {
vector<vector<int>> ans;
if(root==NULL) return ans;
queue<TreeNode*> res;
res.push(root);
while(!res.empty()){
int len=res.size();
vector<int> temp;
for(int i=0;i<len;i++){
TreeNode* now=res.front();
res.pop();
temp.push_back(now->val);
if(now->left!=NULL) res.push(now->left);
if(now->right!=NULL) res.push(now->right);
}
ans.insert(ans.begin(),temp);
}
return ans;
}
};