543. Diameter of Binary Tree

二叉树直径计算

最新推荐文章于 2022-02-12 16:20:22 发布

原创最新推荐文章于 2022-02-12 16:20:22 发布 · 271 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

220 篇文章

订阅专栏

本文介绍了一种计算二叉树最长路径（直径）的方法，该路径可以不通过根节点。通过递归辅助函数，计算每个节点左右子树的最大深度，并以此来确定最长路径。

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 longestpath 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].

Note: The length of path between two nodes is represented by the number of edges between them.

Subscribe to see which companies asked this question.

/**
 * 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) {
        helper(root);
		return max;
    }
    public int helper(TreeNode root) {
		if (root == null)
			return 0;
		int left = helper(root.left);
		int right = helper(root.right);
		max = Math.max(max, left + right);
		return 1 + Math.max(left, right);
	}
}