剑指offer-二叉树的深度

 1 /*
 2 struct TreeNode {
 3     int val;
 4     struct TreeNode *left;
 5     struct TreeNode *right;
 6     TreeNode(int x) :
 7             val(x), left(NULL), right(NULL) {
 8     }
 9 };*/
10 class Solution {
11 public:
12     int max_dep = 0;
13     int cur_dep = 0;
14     int TreeDepth(TreeNode* pRoot)
15     {
16         if(pRoot != NULL){
17             cur_dep++;
18             if(pRoot->left)
19                 TreeDepth(pRoot->left);
20             if(pRoot->right)
21                 TreeDepth(pRoot->right);
22             if(pRoot->left == NULL&&pRoot->right == NULL)
23                 if(cur_dep > max_dep)
24                     max_dep = cur_dep;
25             cur_dep--;
26             return max_dep;
27         }
28         return max_dep;
29     }
30 };