<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lca on</title><link>https://h30306.github.io/blog/zh-tw/tags/lca/</link><description>Recent content in Lca on</description><generator>Hugo -- gohugo.io</generator><language>zh-tw</language><managingEditor>hwork0511@gmail.com (Wei Yi Chung)</managingEditor><webMaster>hwork0511@gmail.com (Wei Yi Chung)</webMaster><copyright>© 2026 Wei Yi Chung</copyright><lastBuildDate>Fri, 11 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/lca/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 2509: Cycle Length Queries in a Tree</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2509/</link><pubDate>Fri, 11 Sep 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2509/</guid><description>LeetCode 2509 解題筆記：完全二元樹的編號，parent 就是 v // 2，比較大的往上爬到 LCA</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-2509/featured.png"/></item><item><title>LeetCode 865: Smallest Subtree with all the Deepest Nodes</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-865/</link><pubDate>Fri, 09 Jan 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-865/</guid><description>LeetCode 865 解題筆記：BFS 找最後一層再一起往上爬，或一次 DFS 回傳 (深度, 節點)</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-865/featured.png"/></item></channel></rss>