算法：求树的最大深度104. Maximum Depth of Binary Tree

AI架构师易筋

于 2020-12-16 10:02:56 发布

阅读量243

点赞数

分类专栏：算法文章标签： 104 max depth leetcode 树的最大深度

本文链接：https://blog.csdn.net/zgpeace/article/details/111246193

版权

算法专栏收录该内容

219 篇文章 6 订阅

订阅专栏

这篇博客介绍了如何使用深度优先搜索(DFS)解决LeetCode上的第104题——计算二叉树的最大深度。通过递归实现，当遇到空节点时返回0，否则返回左子树和右子树中最大深度加1。示例代码展示了Java实现，对于给定的几个测试用例，都能正确计算出最大深度。

摘要由CSDN通过智能技术生成

LeetCode全集请参考：LeetCode Github 大全

题目

104. Maximum Depth of Binary Tree

Given the root of a binary tree, return its maximum depth.

A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Example 1:
在这里插入图片描述

Input: root = [3,9,20,null,null,15,7]
Output: 3

Example 2:

Input: root = [1,null,2]
Output: 2

Example 3:

Input: root = []
Output: 0

Example 4:

Input: root = [0]
Output: 1

Constraints:

The number of nodes in the tree is in the range [0, 104].
-100 <= Node.val <= 100

深度优先算法

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int maxDepth(TreeNode root) {
        // check edge
        if (root == null) {
            return 0;
        }
        
        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
    }
}