/**
* 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:
int maxDepth(TreeNode* root) {
if(!root) {
return 0;
}
return 1 + max(maxDepth(root->left),maxDepth(root->right));
}
};
【二叉树】【递归】剑指Offer.55.二叉树的深度
最新推荐文章于 2023-02-20 10:29:14 发布