[LeetCode 解题报告]104. Maximum Depth of Binary Tree

最新推荐文章于 2024-10-15 15:32:42 发布

caicaiatnbu

最新推荐文章于 2024-10-15 15:32:42 发布

阅读量144

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 解题报告

本文链接：https://blog.csdn.net/caicaiatnbu/article/details/103303129

LeetCode 解题报告专栏收录该内容

154 篇文章

订阅专栏

本文探讨了二叉树的最大深度求解方法，通过递归和迭代两种方式实现，旨在寻找从根节点到最远叶节点的最长路径上的节点数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

return its depth = 3.

Method 1. Recursively

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if (root == NULL)
            return 0;
        return 1 + max(maxDepth(root->left), maxDepth(root->right));
    }
};

Method 2. Iteratively

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if (root == NULL)
            return 0;
        int res = 0;
        queue<TreeNode*> que;
        que.push(root);
        
        while (!que.empty()) {
            res ++;
            int levelSize = que.size();
            for (int i = 0; i < levelSize; i ++) {
                TreeNode* node = que.front();
                que.pop();
                
                if (node->left)
                    que.push(node->left);
                if (node->right)
                    que.push(node->right);
            }
        }
        return res;
    }
};