<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title> 算法面试 - 标签 - 五岁博客</title>
        <link>https://fiveyoboy.com/tags/-%E7%AE%97%E6%B3%95%E9%9D%A2%E8%AF%95/</link>
        <description> 算法面试 - 标签 - 五岁博客</description>
        <generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>fiveyoboy@qq.com (五岁博客)</managingEditor>
            <webMaster>fiveyoboy@qq.com (五岁博客)</webMaster><lastBuildDate>Sun, 22 Mar 2026 00:00:00 &#43;0000</lastBuildDate><atom:link href="https://fiveyoboy.com/tags/-%E7%AE%97%E6%B3%95%E9%9D%A2%E8%AF%95/" rel="self" type="application/rss+xml" /><item>
    <title>二叉树遍历详解：前序、中序、后序、层序 4 种方式图文讲解与 Go 实现</title>
    <link>https://fiveyoboy.com/articles/binary-tree-traversal/</link>
    <pubDate>Sun, 22 Mar 2026 00:00:00 &#43;0000</pubDate>
    <author>五岁博客</author>
    <guid>https://fiveyoboy.com/articles/binary-tree-traversal/</guid>
    <description><![CDATA[<h2 id="概述">概述</h2>
<p>二叉树遍历是数据结构与算法领域的基础知识点，也是各大厂面试中的高频考题。简单来说，<strong>遍历就是按照某种特定顺序，依次访问二叉树中的每一个节点，且每个节点恰好被访问一次</strong>。</p>]]></description>
</item>
</channel>
</rss>
