本题很简单，如果对递归的思想非常熟悉的，可以很快解出这个题目
直接上代码:
int maxDepth(TreeNode* root) {
TreeNode *tempTreeNode = root;
if (tempTreeNode == NULL) {
return 0;
}
int left = maxDepth(tempTreeNode->left);
int right = maxDepth(tempTreeNode->right);
return (left > right ? left : right) + 1;
}
maximum depth of binary tree 题目：Given a binary tree, find...
104. Maximum Depth of Binary Tree226. Invert Binary Tree ...
104. Maximum Depth of Binary Tree 题目链接 104. Maximum Depth...
Given a binary tree, find its maximum depth. The maximum ...
Given a binary tree, find its maximum depth. The maximum ...
Given a binary tree, find its maximum depth. The maximum ...
Given a binary tree, find its maximum depth. The maximum ...
Given a binary tree, find its maximum depth. The maximum ...
Given a binary tree, find its maximum depth. The maximum ...
Given a binary tree, find its maximum depth. The maximum ...
本文标题：Maximum Depth of Binary Tree - 返
本文链接：https://www.haomeiwen.com/subject/mpqputtx.html
网友评论