104. Maximum Depth of Binary Tree

104. Maximum Depth of Binary Tree

 

 

Total Accepted: 136537 Total Submissions: 286367 Difficulty: Easy

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(struct TreeNode* root) {
    if(!root)
        return 0;
     int l = maxDepth(root->left);
     int r = maxDepth(root->right);
     return l>r?l+1:r+1;
}