题目描述:
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
Example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
题目大意:给一棵二叉树,输出每一层的所有数。
思路:维护一个全局的数组和一个层数,然后爱怎么遍历怎么遍历,遍历到的数加入属于的层数的数组即可。
c++代码:
/**
* 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>> levelOrder(TreeNode* root) {
traverse(root, 0);
return ans;
}
void traverse(TreeNode* root, int level)
{
if (root == nullptr)
return;
else
{
if (ans.size() <= level)
{
vector<int> newLevel;
ans.push_back(newLevel);
}
ans[level].push_back(root->val);
traverse(root->left, level + 1);
traverse(root->right, level + 1);
}
}
private:
vector<vector<int>> ans;
int lv;
};