<?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 Answer</title>
    <link>https://answer.freetools.me/tags/%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86/</link>
    <description>Recent content in 后序遍历 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 22:23:56 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>树形动态规划：为什么一棵树的答案要从叶子开始算</title>
      <link>https://answer.freetools.me/%E6%A0%91%E5%BD%A2%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E4%B8%BA%E4%BB%80%E4%B9%88%E4%B8%80%E6%A3%B5%E6%A0%91%E7%9A%84%E7%AD%94%E6%A1%88%E8%A6%81%E4%BB%8E%E5%8F%B6%E5%AD%90%E5%BC%80%E5%A7%8B%E7%AE%97/</link>
      <pubDate>Sun, 08 Mar 2026 22:23:56 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%A0%91%E5%BD%A2%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E4%B8%BA%E4%BB%80%E4%B9%88%E4%B8%80%E6%A3%B5%E6%A0%91%E7%9A%84%E7%AD%94%E6%A1%88%E8%A6%81%E4%BB%8E%E5%8F%B6%E5%AD%90%E5%BC%80%E5%A7%8B%E7%AE%97/</guid>
      <description>深度解析树形动态规划的核心原理，从后序遍历的本质出发，讲解返回值与全局答案的分离技巧，并通过直径、最大路径和、打家劫舍III、监控二叉树等经典LeetCode题目的Java解法，带你掌握树形DP的解题模式。</description>
    </item>
  </channel>
</rss>
