<?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>后序遍历 on xun's Blog</title><link>https://xungirl.github.io/tags/%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86/</link><description>Recent content in 后序遍历 on xun's Blog</description><generator>Hugo -- 0.168.0</generator><language>en</language><lastBuildDate>Sat, 10 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://xungirl.github.io/tags/%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86/index.xml" rel="self" type="application/rss+xml"/><item><title>2026-10-10 二叉树递归调用顺序学习笔记（左 → 右 → 自己）</title><link>https://xungirl.github.io/posts/2026-10-10-tree-recursion-order/</link><pubDate>Sat, 10 Oct 2026 00:00:00 +0000</pubDate><guid>https://xungirl.github.io/posts/2026-10-10-tree-recursion-order/</guid><description>用可交互的逐步图解看清二叉树递归到底按什么顺序走：一路先钻到最左，左边返回后才去右边，两边都返回后才处理自己。以 LC 124 的 gain 函数为例。</description></item></channel></rss>