Leetcode Maximum Depth of Binary Tree

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.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if (!root)
            return 0;
        if (root->left==NULL&&root->right==NULL)
        {
            return 1;
        }
        else
        {
            int leftdepth = root->left!= NULL? maxDepth(root->left):INT_MIN;
            int rightdepth = root->right!=NULL? maxDepth(root->right):INT_MIN;
            return max(leftdepth,rightdepth)+1;
        }
    }
};