题目:
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
题目要求遍历二叉树并且按照分层保存,个人想法就是随意访问,然后按照层次来保存就行了,相对比较简单。
/**
* 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:
void order(vector<vector<int>>&levels, TreeNode* root, int deep){
if(root == nullptr)return;
if(deep >= levels.size())levels.push_back(vector<int>());
levels[deep].push_back(root->val);
order(levels, root->left, deep+1);
order(levels, root->right, deep+1);
}
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>>levels;
order(levels, root, 0);
return levels;
}
};