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

>>阅读原文<<