达拉崩吧01
获得徽章 0
- #每日一题# LC559 N叉树的最大深度
用DFS依次遍历每棵子树，比较得出最大深度再加1
每次循环之后更新当前depth值
for(auto children;root->children)遍历每一棵子树
赞过 评论1 - #每日一题# 力扣144 递归实现二叉树前序遍历
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
void preorder(TreeNode* root,vector<int>& res)//这里要用地址传递
{
if(root == nullptr)
return;
res.push_back(root->val);
preorder(root->left,res);
preorder(root->right,res);
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
preorder(root,res);
return res;
}
};展开评论点赞
