Tree-Diameter
LeetCode 3203: Find Minimum Diameter After Merging Two Trees
·2 分鐘
LeetCode
Hard
Tree
Bfs
Dfs
Graph
Tree-Diameter
LeetCode 3203 解題筆記：連接兩棵樹的中心，答案是 max(d1, d2, ceil(d1/2) + ceil(d2/2) + 1)
LeetCode 3313: Find the Last Marked Nodes in Tree
·1 分鐘
LeetCode
Hard
Tree
Bfs
Graph
Tree-Diameter
LeetCode 3313 解題筆記：最後被標記的就是最遠的點，而最遠點一定能取直徑端點