二叉树的深度

 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 TreeDepth(TreeNode* pRoot)
13     {
14         if(pRoot==NULL) return 0;
15         int left=TreeDepth(pRoot->left);
16         int right=TreeDepth(pRoot->right);
17         return (left>right?left+1:right+1);
18     }
19 };