LeetCode problem : Maximum Depth of Binary Tree

Problem

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Code

int maxDepth(TreeNode *root) {
    // IMPORTANT: Please reset any member data you declared, as
    // the same Solution instance will be reused for each test case.
    if(!root)
        return 0;
    if(root->left == 0 && root->right == 0)
  return 1;
    if(root->left == 0)
  return 1 + maxDepth(root->right);
    if(root->right == 0)
  return 1 + maxDepth(root->left);
   return ( 1 + max(maxDepth(root->left),maxDepth(root->right)));
}