本文共 484 字，大约阅读时间需要 1 分钟。

/** * 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;}

转载地址：http://qpcki.baihongyu.com/