代码实现(c++):
class Solution
{
public:
int maxDepth(TreeNode* root)
{
if(root==nullptr) return 0;
return max(maxDepth(root->left)+1,maxDepth(root->right)+1);
}
};
运行结果:
代码实现(c++):
class Solution
{
public:
int maxDepth(TreeNode* root)
{
if(root==nullptr) return 0;
return max(maxDepth(root->left)+1,maxDepth(root->right)+1);
}
};
运行结果: