<?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 Lee WooJin | Developer</title>
    <link>https://zmfpdl64.github.io/categories/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98/</link>
    <description>Recent content in 알고리즘 on Lee WooJin | Developer</description>
    <generator>Hugo -- 0.155.1</generator>
    <language>ko-kr</language>
    <lastBuildDate>Thu, 11 May 2023 19:28:14 +0900</lastBuildDate>
    <atom:link href="https://zmfpdl64.github.io/categories/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>이진트리의 전위, 중위, 후위 순회 알아보기</title>
      <link>https://zmfpdl64.github.io/posts/algorithm-binary-tree-traversal/</link>
      <pubDate>Thu, 11 May 2023 19:28:14 +0900</pubDate>
      <guid>https://zmfpdl64.github.io/posts/algorithm-binary-tree-traversal/</guid>
      <description>이진트리의 세 가지 순회 방법(전위, 중위, 후위)의 원리와 구현</description>
    </item>
  </channel>
</rss>
