LeetCode@543_Diameter_of_Binary_Tree

最新推荐文章于 2022-09-04 11:05:13 发布

原创最新推荐文章于 2022-09-04 11:05:13 发布 · 200 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

39 篇文章

订阅专栏

本文介绍了一种计算二叉树最长路径长度的方法，即所谓的二叉树直径。通过递归算法，可以找到从一个节点到另一个节点的最长路径，该路径可能经过根节点也可能不经过。文中提供了一个Java实现示例。

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

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Example:
Given a binary tree

Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

java:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
   int max = 0;
	public int diameterOfBinaryTree(TreeNode root)
	{
		deptMax(root);
        return max;

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