https://h30306.github.io/blog/tags/lca/Recent content in Lca onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungFri, 11 Sep 2026 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-2509/Fri, 11 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2509/LeetCode 2509 note: in heap numbering the parent is v // 2, so climb the larger node until both meet at the LCAhttps://h30306.github.io/blog/leetcode/leetcode-865/Fri, 09 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-865/LeetCode 865 note: BFS to the last level and climb together, or one DFS returning (depth, node)