剑指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 TreeDepth(TreeNode* pRoot) {
13         if(pRoot == NULL) return 0;
14         return max(1+TreeDepth(pRoot->right),1+TreeDepth(pRoot->left));
15     }
16 };