二叉树的深度

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