awesome-repositories.com
博客
MCP
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目MCP 服务器关于排名机制媒体报道
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 个仓库

Awesome GitHub RepositoriesReverse Level-Order Traversals

Algorithms that visit tree nodes from bottom to top, collecting each level and inserting at the front of the result.

Distinct from Tree Traversal Algorithms: Distinct from Level-Order Traversals: processes levels in reverse order, bottom-up rather than top-down.

Explore 2 awesome GitHub repositories matching software engineering & architecture · Reverse Level-Order Traversals. Refine with filters or upvote what's useful.

Awesome Reverse Level-Order Traversals GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • soapyigu/leetcode-swiftsoapyigu 的头像

    soapyigu/LeetCode-Swift

    4,958在 GitHub 上查看↗

    LeetCode-Swift is a collection of algorithm solutions written in Swift, designed for coding interview preparation. Each solution is implemented as a self-contained function with no external dependencies, making it easy to run and test. The repository organizes solutions by topic and company, and every file includes time and space complexity annotations, allowing quick evaluation of algorithmic efficiency. What sets this repository apart is its flat file structure and the way solutions are tagged with the companies that asked them in interviews, enabling targeted practice. All code resides in

    Provides reverse level-order traversal, processing nodes from bottom to top.

    Swiftalgorithmdata-structuresinterview
    在 GitHub 上查看↗4,958
  • hoanhan101/algohoanhan101 的头像

    hoanhan101/algo

    3,678在 GitHub 上查看↗

    This project is a Go algorithm implementation library and a reference for data structures. It serves as a collection of solved coding interview problems and an algorithmic pattern collection, providing a reference of over 100 common challenges implemented in Go. The library focuses on specific problem-solving strategies, including sliding windows, two pointers, and dynamic programming. It provides coded examples of standard sorting, searching, and graph traversal techniques to facilitate the study of algorithmic patterns. The repository covers a broad range of capabilities, including array a

    Groups binary tree nodes by level and returns them from the deepest leaf back to the root.

    Go
    在 GitHub 上查看↗3,678
  1. Home
  2. Software Engineering & Architecture
  3. Tree Traversal Algorithms
  4. Reverse Level-Order Traversals