题目:
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
For 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] ]分析:
使用广度搜索递归
代码:
/**
* 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>> res;
void BFS(TreeNode * root,int level)
{
if(root==NULL)
return ;
if(level==res.size())
{
res.push_back(vector<int>());
}
res[level].push_back(root->val);
BFS(root->left,level+1);
BFS(root->right,level+1);
}
vector<vector<int>> levelOrder(TreeNode* root) {
if(root==NULL)
return res;
BFS(root,0);
return res;
}
};