题解 | #二叉树的深度#
https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b
int TreeDepth(struct TreeNode* pRoot ) {
if(pRoot==NULL){
return 0;
}
int depth;
int left_depth=TreeDepth(pRoot->left);
int right_depth=TreeDepth(pRoot->right);
depth=left_depth>right_depth?left_depth+1:right_depth+1;
return depth;
}