<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Binary-Lifting on</title><link>https://h30306.github.io/blog/zh-tw/tags/binary-lifting/</link><description>Recent content in Binary-Lifting 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, 18 Nov 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/binary-lifting/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 236: Lowest Common Ancestor of a Binary Tree</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-236/</link><pubDate>Fri, 18 Nov 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-236/</guid><description>LeetCode 236 解題筆記：遞迴回傳子樹裡找到的 p 或 q；左右都找到代表在這裡分岔，這個節點就是 LCA</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-236/featured.png"/></item></channel></rss>