第二次
class Solution
{
public:
int maxDepth(TreeNode *root)
{
return root==NULL? 0:
1 + max(maxDepth(root->left), maxDepth(root->right));
}
};
class Solution
{
public:
int maxDepth(TreeNode *root)
{
if (root == NULL)
{
return 0;
} else
{
return 1 + max(maxDepth(root->left), maxDepth(root->right));
}
}
};