description

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.

solution

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int maxDepth(struct TreeNode* root) {
    if(!root){
        return 0;
    }
    int ldepth=maxDepth(root->left);
    int rdepth=maxDepth(root->right);
    return ldepth>rdepth?ldepth+1:rdepth+1;
}