/**
* 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:
//final result, contains vectors represent nodes of each level
vector<vector<int>> result;
vector<vector<int>> levelOrder(TreeNode* root) {
if(root == NULL)
return result;
queue<TreeNode> level;
level.push(*root);
travel(level);
return result;
}
void travel(queue<TreeNode> levelFather){
queue<TreeNode> level;
vector<int> levelResult;
while(!levelFather.empty()){
TreeNode node = levelFather.front();
levelFather.pop();
levelResult.push_back(node.val);
if(node.left != NULL)
level.push(*(node.left));
if(node.right != NULL)
level.push(*(node.right));
}
result.push_back(levelResult);
if(!level.empty())
travel(level);
}
};
二叉树层次遍历(C++)
最新推荐文章于 2024-06-18 13:52:22 发布