<?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>Data Structure on Ishian</title><link>https://echo.ishian.me/categories/data-structure/</link><description>Recent content in Data Structure on Ishian</description><generator>Hugo</generator><language>en</language><lastBuildDate>Thu, 27 Aug 2026 15:05:37 +0000</lastBuildDate><atom:link href="https://echo.ishian.me/categories/data-structure/index.xml" rel="self" type="application/rss+xml"/><item><title>数据结构: B+树</title><link>https://echo.ishian.me/2026/08/27/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-b-%E6%A0%91/</link><pubDate>Thu, 27 Aug 2026 15:05:37 +0000</pubDate><guid>https://echo.ishian.me/2026/08/27/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-b-%E6%A0%91/</guid><description>讲解B+树的结构原理、插入删除操作及其在数据库索引中的应用</description></item><item><title>数据结构: 笛卡尔树</title><link>https://echo.ishian.me/2025/05/30/algo-descartes-tree/</link><pubDate>Fri, 30 May 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/05/30/algo-descartes-tree/</guid><description>讲解笛卡尔树的定义、性质、单调栈O(n)建树方法及其在连续区间问题中的应用</description></item><item><title>图的遍历: 链式前向星</title><link>https://echo.ishian.me/2025/04/10/algo-linked-forward-star/</link><pubDate>Thu, 10 Apr 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/04/10/algo-linked-forward-star/</guid><description>讲解对顶堆的组成与维护方式，用于动态求解序列中第k小元素</description></item><item><title>数据结构: 对顶堆</title><link>https://echo.ishian.me/2025/04/10/algo-minmax-heap/</link><pubDate>Thu, 10 Apr 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/04/10/algo-minmax-heap/</guid><description>讲解对顶堆的组成与维护方式，用于动态求解序列中第k小元素</description></item><item><title>数据结构: 递归式线段树</title><link>https://echo.ishian.me/2025/04/10/algo-recursive-segment-tree/</link><pubDate>Thu, 10 Apr 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/04/10/algo-recursive-segment-tree/</guid><description>讲解递归式线段树的结构、建树、懒标记与区间修改、区间查询的实现</description></item><item><title>数据结构: 前缀和</title><link>https://echo.ishian.me/2025/03/19/algo-prefix-sum/</link><pubDate>Wed, 19 Mar 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/03/19/algo-prefix-sum/</guid><description>介绍一维与二维前缀和的原理、性质、原地实现及差分应用场景</description></item><item><title>数据结构: 树状数组</title><link>https://echo.ishian.me/2025/03/19/algo-fenwick-tree/</link><pubDate>Wed, 19 Mar 2025 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2025/03/19/algo-fenwick-tree/</guid><description>讲解树状数组的基本结构、lowbit原理、区间查询与单点修改的实现及适用范围</description></item><item><title>数据结构: 哈希表</title><link>https://echo.ishian.me/2024/11/16/algo-hashmap/</link><pubDate>Sat, 16 Nov 2024 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2024/11/16/algo-hashmap/</guid><description>介绍哈希函数的设计原则、常见哈希算法及哈希表的原理、冲突处理与实现</description></item><item><title>数据结构: 并查集</title><link>https://echo.ishian.me/2024/10/02/algo-ufs/</link><pubDate>Wed, 02 Oct 2024 00:00:00 +0000</pubDate><guid>https://echo.ishian.me/2024/10/02/algo-ufs/</guid><description>介绍并查集的原理、合并与查询操作、路径压缩与按秩合并优化</description></item></channel></rss>