题解 | #二叉树的深度#
二叉树的深度
http://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b
class Solution {
public:
int TreeDepth(TreeNode* pRoot) {
if(pRoot==NULL)return 0;
return 1+max(TreeDepth(pRoot->left),TreeDepth(pRoot->right));
}
};