题解 | #二叉树的深度#

class Solution {
public:
    int TreeDepth(TreeNode* pRoot) {
        if(pRoot==NULL)return 0;
        return 1+max(TreeDepth(pRoot->left),TreeDepth(pRoot->right));
    }
};