2 dépôts
Awesome GitHub RepositoriesPostorder Traversals
Algorithms that visit nodes in left-right-root order, implemented iteratively using a stack.
Distinct from Tree Traversal Algorithms: Distinct from general Tree Traversal Algorithms: focuses specifically on postorder ordering rather than covering all traversal strategies.
Explore 2 awesome GitHub repositories matching software engineering & architecture · Postorder Traversals. Refine with filters or upvote what's useful.
Awesome Postorder Traversals GitHub Repositories
Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
- apachecn/apachecn-algo-zh
apachecn/apachecn-algo-zh
11,140Voir sur GitHubThis project is an algorithm study resource, a centralized LeetCode solution repository, and a technical interview study guide. It provides Chinese translations of textbooks and guides on data structures and algorithms for academic study and professional preparation. The project distinguishes itself by delivering multi-language solution repositories and translated academic materials through a static site generation model. This architecture enables compile-time content translation and offline-first delivery of educational assets as static files. The repository covers a wide range of algorithm
Implements binary tree visitation in a left-right-root sequence.
JavaScriptalgorithmcodingdata-structure - soapyigu/leetcode-swift
soapyigu/LeetCode-Swift
4,958Voir sur GitHubLeetCode-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
Implements iterative postorder traversal for binary trees.
Swiftalgorithmdata-structuresinterview
