给定一个二叉树,返回其按层次遍历的节点值。 (即逐层地,从左到右访问所有节点)。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[15,7]
]
一、DFS解法
/**
* 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) {
vector<vector<int>> res;
func(root,0,res);
return res;
}
void func(TreeNode *root,int level,vector<vector<int>> &res)
{
if(!root) return;
if ((level+1) > res.size())
res.push_back(vector<int> {});
res[level].push_back(root->val);
func(root->left,level+1,res);
func(root->right,level+1,res);
}
};
二、BFS解法
/**
* 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) {
vector<vector<int>> res;
if(!root) return res;
queue<TreeNode*> sameLevel;
vector<int> row;
sameLevel.push(root);
while(!sameLevel.empty())
{
int size = sameLevel.size();
for(int i=0;i<size;i++){
TreeNode *cur = sameLevel.front();
sameLevel.pop();
row.push_back(cur->val);
if(cur->left) sameLevel.push(cur->left);
if(cur->right) sameLevel.push(cur->right);
}
res.push_back(row);
row.clear();
}
return res;
}
};