题解 | #二叉树的最大深度#
二叉树的最大深度
https://www.nowcoder.com/practice/8a2b2bf6c19b4f23a9bdb9b233eefa73
int maxDepth(struct TreeNode* root ) {
// write code here
if (root == NULL)
return 0;
int ldeep = maxDepth(root->left);
int rdeep = maxDepth(root->right);
if (ldeep >rdeep)
return 1 + ldeep;
else
return 1 + rdeep;
}
查看22道真题和解析