0543-diameter-of-binary-tree.adoc

543. Diameter of Binary Tree

{leetcode}/problems/diameter-of-binary-tree/[LeetCode - Diameter of Binary Tree^]

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
        1
       / \
      2   3
     / \
    4   5
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.

解题分析

这道题就是一个深度优先搜索。不同之处在于，要在遍历过程中，把直径的最大值保存下来。同时，还要返回子树中最长的路径。

link:{sourcedir}/_0543_DiameterOfBinaryTree.java[role=include]

参考资料

1. 543. 二叉树的直径 - 官方题解

2. 543. 二叉树的直径 - 详解官方递归代码的运行过程