<?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>LeetCode 98 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-98/</link><description>Recent content in LeetCode 98 on Jeanphilo Blog</description><generator>Hugo -- 0.161.1</generator><language>zh-cn</language><lastBuildDate>Sun, 19 Apr 2026 14:52:28 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-98/index.xml" rel="self" type="application/rss+xml"/><item><title>Hot100：验证二叉搜索树（Validate Binary Search Tree）区间约束 / 中序判序 ACERS 解析</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/98-validate-binary-search-tree/</link><pubDate>Sun, 19 Apr 2026 14:52:28 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/binary-tree/98-validate-binary-search-tree/</guid><description>围绕 LeetCode 98 讲清 BST 的祖先区间约束、不只和父节点比较的核心原因，以及区间递归与中序判序两种稳定写法。</description></item></channel></rss>