<?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/%E6%A0%91%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 21:16:28 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E6%A0%91%E9%81%8D%E5%8E%86/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>二叉树遍历为何如此重要：从递归到Morris的四种实现方式与LeetCode完整通关指南</title>
      <link>https://answer.freetools.me/%E4%BA%8C%E5%8F%89%E6%A0%91%E9%81%8D%E5%8E%86%E4%B8%BA%E4%BD%95%E5%A6%82%E6%AD%A4%E9%87%8D%E8%A6%81%E4%BB%8E%E9%80%92%E5%BD%92%E5%88%B0morris%E7%9A%84%E5%9B%9B%E7%A7%8D%E5%AE%9E%E7%8E%B0%E6%96%B9%E5%BC%8F%E4%B8%8Eleetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 21:16:28 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%BA%8C%E5%8F%89%E6%A0%91%E9%81%8D%E5%8E%86%E4%B8%BA%E4%BD%95%E5%A6%82%E6%AD%A4%E9%87%8D%E8%A6%81%E4%BB%8E%E9%80%92%E5%BD%92%E5%88%B0morris%E7%9A%84%E5%9B%9B%E7%A7%8D%E5%AE%9E%E7%8E%B0%E6%96%B9%E5%BC%8F%E4%B8%8Eleetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>深度解析二叉树遍历的核心原理，涵盖前序、中序、后序、层序四种遍历方式，详解递归、迭代、Morris三种实现，并通过20道经典LeetCode题目的Java解法，带你掌握二叉树问题的解题模式。</description>
    </item>
    <item>
      <title>深度优先与广度优先搜索:从栈与队列的选择到最短路径的博弈</title>
      <link>https://answer.freetools.me/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E4%B8%8E%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E4%BB%8E%E6%A0%88%E4%B8%8E%E9%98%9F%E5%88%97%E7%9A%84%E9%80%89%E6%8B%A9%E5%88%B0%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E7%9A%84%E5%8D%9A%E5%BC%88/</link>
      <pubDate>Sun, 08 Mar 2026 20:26:33 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E4%B8%8E%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E4%BB%8E%E6%A0%88%E4%B8%8E%E9%98%9F%E5%88%97%E7%9A%84%E9%80%89%E6%8B%A9%E5%88%B0%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E7%9A%84%E5%8D%9A%E5%BC%88/</guid>
      <description>一篇系统讲解DFS与BFS算法的完整指南，从核心原理到实现细节，结合LeetCode经典题目（104/102/200/226/236/127/130/133/207等）的Java实现与复杂度分析，帮助你彻底掌握这两种面试必考的图遍历算法。</description>
    </item>
  </channel>
</rss>
