AcWing 44. 分行从上往下打印二叉树
原题链接
中等
作者:
George
,
2020-11-19 00:37:35
,
所有人可见
,
阅读 388
/**
* 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;
vector<vector<int>> printFromTopToBottom(TreeNode* root) {
if(!root) return res;
dfs(root, 0);
return res;
}
void dfs(TreeNode *&node, int level){
if(level == res.size()) res.push_back(vector<int>{});
res[level].push_back(node->val);
if(node->left) dfs(node->left, level+1);
if(node->right) dfs(node->right, level+1);
}
};