<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Tree Algo on Ishian</title><link>https://echo.ishian.me/categories/tree-algo/</link><description>Recent content in Tree Algo on Ishian</description><generator>Hugo</generator><language>en</language><lastBuildDate>Wed, 11 Jun 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://echo.ishian.me/categories/tree-algo/index.xml" rel="self" type="application/rss+xml"/><item><title>树的算法: 点分治</title><link>https://echo.ishian.me/2025/06/11/algo-tree-point-dac/</link><pubDate>Wed, 11 Jun 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/06/11/algo-tree-point-dac/</guid><description>讲解点分治处理树上路径统计问题的分治结构、找重心与合并过程</description></item><item><title>树的算法: LCA（最近公共祖先）</title><link>https://echo.ishian.me/2025/04/30/algo-tree-lca/</link><pubDate>Wed, 30 Apr 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/04/30/algo-tree-lca/</guid><description>介绍LCA的性质、朴素算法与倍增算法的原理和实现</description></item><item><title>树的算法: 寻找树的重心</title><link>https://echo.ishian.me/2025/04/30/algo-tree-gravity/</link><pubDate>Wed, 30 Apr 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/04/30/algo-tree-gravity/</guid><description>讲解树的重心的定义与性质，并给出DFS求重心的O(n)算法实现</description></item></channel></rss>