题解 | #二叉树的最大深度#
二叉树的最大深度
https://www.nowcoder.com/practice/8a2b2bf6c19b4f23a9bdb9b233eefa73
/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
class Solution {
public:
/**
*
* @param root TreeNode类
* @return int整型
*/
int maxDepth(TreeNode* root) {
if (root == nullptr) return 0;
int l_deep = maxDepth(root->left);
int r_deep = maxDepth(root->right);
return max(l_deep, r_deep) + 1;
}
};
2023-剑指-二叉树 文章被收录于专栏
2023-剑指-二叉树
查看29道真题和解析