https://h30306.github.io/blog/tags/tree-diameter/Recent content in Tree-Diameter onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungThu, 15 Oct 2026 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-3203/Thu, 15 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-3203/LeetCode 3203 note: connect the two centers; the answer is max(d1, d2, ceil(d1/2) + ceil(d2/2) + 1)https://h30306.github.io/blog/leetcode/leetcode-3313/Thu, 17 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-3313/LeetCode 3313 note: the last marked node is the farthest one, and a farthest node can always be a diameter endpoint