leetcode 找到树中距离最大的两个结点，Python实现

题目：node 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

>>阅读原文<<