https://benzhub.github.io/tags/binary-tree/Recent content in Binary Tree on BenzHubHugozh-TWMon, 22 Jun 2026 00:00:00 +0000https://benzhub.github.io/post/javascript/data-structures--algorithms/009-binary-tree/Mon, 22 Jun 2026 00:00:00 +0000https://benzhub.github.io/post/javascript/data-structures--algorithms/009-binary-tree/<blockquote> <p><strong>二元樹（Binary Tree）</strong> 是每個節點最多有兩個子節點的樹狀結構，也是學習遞迴思維的最佳切入點。掌握四種遍歷方式與遞迴/迭代的雙重實作，你將能解決絕大多數樹相關的面試題，同時深刻理解 <strong>DFS</strong> 與 <strong>BFS</strong> 兩大搜尋框架的本質。</p> </blockquote>