LeetCode_104. Maximum Depth of Binary Tree

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

B1334628598

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

阅读量360

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/denggelin/p/11608134.html

本文介绍了一种求解二叉树最大深度的算法，并通过一个具体的例子进行了演示。该算法利用递归的方式，计算从根节点到最远叶子节点的路径长度。

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

104. Maximum Depth of Binary Tree

Easy

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.

package leetcode.easy;

public class MaximumDepthOfBinaryTree {
	@org.junit.Test
	public void test() {
		TreeNode tn11 = new TreeNode(3);
		TreeNode tn21 = new TreeNode(9);
		TreeNode tn22 = new TreeNode(20);
		TreeNode tn33 = new TreeNode(15);
		TreeNode tn34 = new TreeNode(7);
		tn11.left = tn21;
		tn11.right = tn22;
		tn21.left = null;
		tn21.right = null;
		tn22.left = tn33;
		tn22.right = tn34;
		tn33.left = null;
		tn33.right = null;
		tn34.left = null;
		tn34.right = null;
		System.out.println(maxDepth(tn11));
	}

	public int maxDepth(TreeNode root) {
		if (root == null) {
			return 0;
		}
		return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
	}
}

转载于:https://www.cnblogs.com/denggelin/p/11608134.html