Diameter of Binary Tree

flyatcmu

已于 2022-04-13 07:37:41 修改

阅读量252

点赞数

分类专栏： traverse 文章标签： leetcode

于 2020-03-23 05:05:00 首次发布

本文链接：https://blog.csdn.net/u013325815/article/details/105040362

版权

traverse 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

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

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

思路：divide and conquer, helper function返回的物理意义是：最长的node数目，所以最后要求边，如果res[0] 不是0，就要-1；

/**
 * 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 diameterOfBinaryTree(TreeNode root) {
        int[] res = new int[]{0};
        dfs(root, res);
        return res[0] - 1;
    }
    
    private int dfs(TreeNode root, int[] res) {
        if(root == null) {
            return 0;
        }
        int leftdepth = dfs(root.left, res);
        int rightdepth = dfs(root.right, res);
        int curdepth = Math.max(leftdepth, rightdepth) + 1;
        res[0] = Math.max(res[0], leftdepth + rightdepth + 1);
        return curdepth;
    }
}