Maximum Depth of Binary Tree

最新推荐文章于 2025-07-18 20:47:52 发布

停止更新+1

最新推荐文章于 2025-07-18 20:47:52 发布

阅读量275

点赞数

CC 4.0 BY-SA版权

文章标签： LEETCODE 算法二叉树高度

本文链接：https://blog.youkuaiyun.com/anyicheng2015/article/details/42264935

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文介绍了两种方法来计算给定二叉树的最大深度：一种使用队列进行层次遍历，另一种采用递归方法。详细解释了每种方法的实现过程，并通过实例展示了如何应用这些算法。

摘要生成于 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.

应该有很多方法吧。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode *root) {
        int depth = 0;
        queue<TreeNode *> level;
        if(root != NULL)
            level.push(root);
        while(!level.empty()) {
            depth ++;
            // Build the new level
            queue<TreeNode *> newlevel;
            while(!level.empty()) {
                TreeNode *front = level.front();
                level.pop();
                if(front->left != NULL)
                    newlevel.push(front->left);
                if(front->right != NULL)
                    newlevel.push(front->right);
            }
            level = newlevel;
        }
        return depth;
    }
};

/**
 * Definition for binary tree
 * 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 leftdepth = maxDepth(root->left);
        int rightdepth = maxDepth(root->right);
        
        return leftdepth > rightdepth ? leftdepth + 1 : rightdepth + 1;
    }
};