二叉树的深度

 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     void DFS(TreeNode *pRoot, int &maxDeepth, int curDeepth)
13     {
14         ++curDeepth;
15         if(pRoot->left)DFS(pRoot->left, maxDeepth, curDeepth);
16         if(pRoot->right)DFS(pRoot->right, maxDeepth, curDeepth);
17         if(curDeepth>maxDeepth)maxDeepth=curDeepth;
18     }
19     int TreeDepth(TreeNode* pRoot)
20     {
21         if(pRoot==NULL)return 0;
22         int maxDeepth=0;
23         int curDeepth=0;
24         DFS(pRoot, maxDeepth, curDeepth);
25         return maxDeepth;
26     }
27 };