剑指 Offer 32 - II. 从上到下打印二叉树 II
题目:
从上到下按层打印二叉树,同一层的节点按从左到右的顺序打印,每一层打印到一行。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[
[3],
[9,20],
[15,7]
]
题解:
BFS
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> ans;
if(!root) return ans;
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
vector<int>ceng;
for(int i=q.size();i>0;i--){
TreeNode*p=q.front();
q.pop();
ceng.push_back(p->val);
if(p->left) q.push(p->left);
if(p->right) q.push(p->right);
}
ans.push_back(ceng);
}
return ans;
}
};
时间复杂度O(n),空间复杂度O(n)
2.DFS
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> res;
dfs(root,0,res);
return res;
}
void dfs(TreeNode *root,int level,vector<vector<int>> &res){
if(!root) return;
if(level>=res.size()) res.push_back(vector<int>());
res[level].push_back(root->val);
dfs(root->left,level+1,res);
dfs(root->right,level+1,res);
}
};
时间复杂度O(n),空间复杂度O(n)