二叉树的深度

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int maxdeep;
void Maxdeep(struct TreeNode*root,int deep)
{
    if(deep>maxdeep)
    {
        maxdeep=deep;
    }
    if(root->left!=NULL)Maxdeep(root->left,deep+1);
    if(root->right!=NULL)Maxdeep(root->right,deep+1);
}
int maxDepth(struct TreeNode* root){
    if(root==NULL)return 0;
    maxdeep=-1;
    Maxdeep(root,1);
    return maxdeep;

}

来源：CSDN

作者：single aloner

链接：https://blog.csdn.net/qq_45863239/article/details/104283444