题目:
![](https://img-blog.csdnimg.cn/f9ee05d0e7fc44b590e82558ee9ffdc7.png)
代码(首刷自解 day23):
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==nullptr) return 0;
return max(maxDepth(root->left),maxDepth(root->right))+1;
}
};
代码(二刷自解 迭代法 2024年1月24日)
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root == nullptr) return 0;
queue<TreeNode*> que;
TreeNode* cur = root;
que.push(cur);
int size = 0;
int depth = 0;
while (!que.empty()) {
size = que.size();
while (size--){
if (size == 0) depth++;
TreeNode* node = que.front();
que.pop();
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
}
return depth;
}
};
递归法(二刷自解 2024年1月25日)
class Solution {
public:
int maxDepth(TreeNode* root) {
if (root == nullptr) return 0;
int maxDeep = max(maxDepth(root->left),maxDepth(root->right)) + 1;
return maxDeep;
}
};
代码(三刷看解析 迭代法 2024年3月5日)
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode* root) {
if (!root) return 0;
int maxDeep = 0;
TreeNode* cur = root;
queue<TreeNode*> st;
st.push(cur);
while (!st.empty()) {
int size = st.size();
for (int i = 0; i < size; ++i) {
TreeNode* node = st.front();
st.pop();
if (node->left) st.push(node->left);
if (node->right) st.push(node->right);
}
maxDeep++;
}
return maxDeep;
}
};