剑指offer 二叉树的深度

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};*/
class Solution {
public:
    int TreeDepth(TreeNode* pRoot)
    {
        if(pRoot!=NULL){
            int depthL=TreeDepth(pRoot->left);
            int depthR=TreeDepth(pRoot->right);
            int max=depthL>depthR?depthL:depthR;
            return max+1;
        }else{
            return 0;
        }
    }
};