[思路：]
- 寻找树的最大深度，深度优先；
int maxDepth(TreeNode* root) {
if (!root) return 0;
return max(maxDepth(root->left), maxDepth(root->right)) + 1;
}
[思路：]
int maxDepth(TreeNode* root) {
if (!root) return 0;
return max(maxDepth(root->left), maxDepth(root->right)) + 1;
}
104. Maximum Depth of Binary Tree 题目链接 104. Maximum Depth...
104. Maximum Depth of Binary Tree226. Invert Binary Tree ...
104. Maximum Depth of Binary Tree 110. Balanced Binary Tr...
104. Maximum Depth of Binary Tree Description Given a bin...
Depth-first Search（深度优先搜索） 104. Maximum Depth of Binary T...
104. Maximum Depth of Binary Tree 题目:https://leetcode.com...
一：递归 二：广度优先遍历
https://leetcode.com/problems/maximum-depth-of-binary-tre...
解法一：递归： 解法二：层次遍历
问题描述 Given a binary tree, find its maximum depth.The maxi...
本文标题：104. Maximum Depth of Binary Tre
本文链接：https://www.haomeiwen.com/subject/nhlufftx.html
网友评论