2 repositorios
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
Encuentra los mejores repositorios con IA.Buscaremos los repositorios que mejor coincidan usando IA.
- soapyigu/leetcode-swift
soapyigu/LeetCode-Swift
4,958Ver en 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
Provides reverse level-order traversal, processing nodes from bottom to top.
Swiftalgorithmdata-structuresinterview - hoanhan101/algo
hoanhan101/algo
3,678Ver en GitHubThis 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
