awesome-repositories.com
Blog
MCP
awesome-repositories.com

Découvrez les meilleurs dépôts open-source grâce à notre recherche par IA.

ExplorerRecherches sélectionnéesAlternatives open sourceLogiciels auto-hébergésBlogPlan du site
ProjetServeur MCPÀ proposNotre méthodologiePresse
Mentions légalesConfidentialitéConditions d'utilisation
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

103 dépôts

Awesome GitHub RepositoriesTree Traversal Algorithms

Algorithms and data structures designed for efficient navigation and query processing in hierarchical or tree-based data.

Distinguishing note: No existing candidates for tree-specific search optimizations; this provides a home for hierarchical navigation techniques.

Explore 103 awesome GitHub repositories matching software engineering & architecture · Tree Traversal Algorithms. Refine with filters or upvote what's useful.

Awesome Tree Traversal Algorithms 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.
  • chalarangelo/30-seconds-of-codeAvatar de Chalarangelo

    Chalarangelo/30-seconds-of-code

    128,121Voir sur GitHub↗

    30-seconds-of-code is a comprehensive knowledge base and programming snippet library designed to support software engineering education and professional development. It provides a curated collection of reusable code units and technical guides that help developers master core language mechanics, design patterns, and architectural philosophies. The project distinguishes itself by offering a wide-ranging library of algorithmic solutions and web development patterns that are organized into modular, independently testable units. It emphasizes functional programming paradigms and declarative logic,

    Provides tree traversal algorithms to measure the diameter of undirected tree structures.

    JavaScriptastroawesome-listcss
    Voir sur GitHub↗128,121
  • azl397985856/leetcodeAvatar de azl397985856

    azl397985856/leetcode

    55,758Voir sur GitHub↗

    This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t

    Implements recursive and iterative algorithms for preorder and postorder tree traversals.

    JavaScriptalgoalgorithmalgorithms
    Voir sur GitHub↗55,758
  • vectifyai/pageindexAvatar de VectifyAI

    VectifyAI/PageIndex

    33,103Voir sur GitHub↗

    PageIndex is an agent-ready knowledge engine that processes documents into hierarchical tree structures to enable reasoning-based information retrieval. By organizing content into logical trees rather than relying on traditional vector database chunking, the platform preserves the original structure and flow of complex documents. It functions as a Model Context Protocol server, allowing external AI agents to connect to and query indexed knowledge bases through standardized communication protocols. The platform distinguishes itself by using vision-language models to process raw document images

    Enables navigation through hierarchical document structures to locate and extract specific content nodes.

    Pythonagentagentic-aiai
    Voir sur GitHub↗33,103
  • cheeriojs/cheerioAvatar de cheeriojs

    cheeriojs/cheerio

    30,386Voir sur GitHub↗

    Cheerio is an HTML and XML parsing library and server-side DOM implementation. It functions as a markup manipulation tool and CSS selector engine, allowing users to parse, query, and modify HTML or XML documents in non-browser environments. The project provides a DOM-like tree representation of markup strings, enabling programmatic addition, removal, and modification of elements and attributes. It features a prototype-based plugin system that allows the extension of core functionality by adding custom methods to the document prototype. The library covers a broad range of capabilities includi

    Enables navigation of the document hierarchy through recursive traversal of parent, child, and sibling node pointers.

    TypeScriptcheeriodomhacktoberfest
    Voir sur GitHub↗30,386
  • oi-wiki/oi-wikiAvatar de OI-wiki

    OI-wiki/OI-wiki

    26,176Voir sur GitHub↗

    This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin

    Solves knapsack problems on hierarchical structures by combining tree traversal with subset optimization.

    TypeScriptacm-icpcacm-icpc-handbookalgorithms
    Voir sur GitHub↗26,176
  • react-community/react-navigationAvatar de react-community

    react-community/react-navigation

    24,480Voir sur GitHub↗

    React Navigation is a cross-platform routing framework and navigation library designed to synchronize routing logic and navigation flows across Android, iOS, and web platforms. It functions as a mobile app router that coordinates transitions between different application views while maintaining a consistent navigation history. The project provides a system for managing screens and navigation state in React Native applications. It enables the definition of paths and the coordination of movement between views to maintain an organized flow throughout the user experience. The framework covers br

    Tracks the current active screen and navigation history using a nested object tree for predictable state transitions.

    TypeScript
    Voir sur GitHub↗24,480
  • facebook/lexicalAvatar de facebook

    facebook/lexical

    23,562Voir sur GitHub↗

    Lexical is a modular rich text editor framework used to build extensible web-based editors. It functions as a state-driven content editor that maintains a serializable, immutable snapshot of document content to ensure predictable updates and accessibility compliance. The framework is distinguished by its plugin-based architecture and customizable node framework, which allow developers to extend editor behavior through specialized content nodes and encapsulated runtime logic. It also includes a collaborative editing engine capable of synchronizing document state across multiple clients in real

    Allows traversing the document node hierarchy using familial relationships to locate specific content.

    TypeScript
    Voir sur GitHub↗23,562
  • buunguyen/octotreeAvatar de buunguyen

    buunguyen/octotree

    23,200Voir sur GitHub↗

    Octotree is a browser extension that provides a hierarchical file tree for navigating Git repositories and inspecting pull requests on GitHub. It serves as a web-based code browser that allows users to explore project directories and locate source files without cloning the repository locally. The tool includes a pull request viewer designed to analyze code changes by providing a navigable file system during the review process. It synchronizes the view state with the browser address bar to enable shareable deep links to specific files. The system employs virtualized list rendering and asynchr

    Provides a recursive hierarchical tree for traversing repository structures and accessing source files.

    JavaScript
    Voir sur GitHub↗23,200
  • darkreader/darkreaderAvatar de darkreader

    darkreader/darkreader

    22,079Voir sur GitHub↗

    This project is a browser extension that functions as a visual accessibility aid and dark mode generator. It dynamically analyzes web page content to create and apply dark color schemes, aiming to reduce eye strain and improve readability for users. The extension operates by injecting custom style sheets and filters directly into the browser document object model. It distinguishes itself through a combination of automated theme generation and granular control, allowing users to adjust brightness, contrast, and sepia levels. It also supports site-specific overrides and exclusions, enabling use

    Traverses the document object model to identify and transform element color properties based on luminance thresholds.

    TypeScriptaccessibilitychrome-extensiondark-mode
    Voir sur GitHub↗22,079
  • qax-os/excelizeAvatar de qax-os

    qax-os/excelize

    20,682Voir sur GitHub↗

    Excelize is a library for reading and writing spreadsheet files in the Office Open XML format. It provides a comprehensive suite of tools for programmatically creating, modifying, and analyzing workbooks, worksheets, and cell data, ensuring compatibility across various office software suites through structured XML serialization. The library distinguishes itself with a built-in formula calculation engine that evaluates complex mathematical and logical expressions directly against workbook data. It also features a memory-mapped streaming architecture, which allows for the efficient processing o

    Provides algorithms for visiting nodes in hierarchical data structures.

    Goagentaianalytics
    Voir sur GitHub↗20,682
  • wagtail/wagtailAvatar de wagtail

    wagtail/wagtail

    20,366Voir sur GitHub↗

    Wagtail is an open-source content management system built on the Django web framework. It provides a structured, tree-based approach to content modeling, allowing developers to define custom page types and reusable content components that are managed through a highly customizable administrative interface. The platform distinguishes itself through its flexible, block-based content composition system, which enables editors to assemble complex page layouts dynamically. It also offers robust support for multi-site and multi-lingual environments, allowing organizations to manage distinct websites

    Navigates and queries page relationships within the site tree using built-in hierarchical methods.

    Pythoncmsdjangohacktoberfest
    Voir sur GitHub↗20,366
  • camsong/you-dont-need-jqueryAvatar de camsong

    camsong/You-Dont-Need-jQuery

    20,160Voir sur GitHub↗

    This project is a vanilla JavaScript reference guide and implementation collection designed to replace legacy libraries with native browser patterns. It provides a set of native JavaScript patterns for selecting, modifying, and navigating HTML elements, alongside a web API implementation guide for handling events and styles. The project serves as a reference for implementing asynchronous JavaScript patterns using native promises and fetch for remote data and background tasks. It also includes a client-side utility collection for performing data transformations, type validation, and element me

    Provides mechanisms for navigating the document hierarchy using familial node relationships.

    JavaScript
    Voir sur GitHub↗20,160
  • enzymejs/enzymeE

    enzymejs/enzyme

    19,831Voir sur GitHub↗

    Enzyme is a testing utility for React components designed to verify their output and behavior in a test environment. It serves as a test harness for UI components, providing tools to render visual elements, manage state transitions, and simulate synthetic events. The library distinguishes itself through multiple rendering modes, including a shallow rendering engine for isolated unit testing and full DOM rendering for testing deep integration. It employs an adapter-based integration system to maintain compatibility across different versions of the underlying framework. The toolkit covers a br

    Implements selector-based tree traversal to locate and verify specific elements in the rendered output.

    JavaScript
    Voir sur GitHub↗19,831
  • bookstackapp/bookstackAvatar de BookStackApp

    BookStackApp/BookStack

    18,305Voir sur GitHub↗

    BookStack is a self-hosted knowledge base platform designed for organizing, storing, and managing structured documentation. It utilizes a hierarchical content model that arranges information into nested trees of books, chapters, and pages, supported by a dedicated search index for rapid retrieval across the entire knowledge base. The platform distinguishes itself through deep integration with enterprise identity providers, allowing organizations to centralize authentication and access control via LDAP, SAML, or OIDC. It provides extensive administrative control over the content lifecycle, inc

    Provides structured navigation through books and pages using sidebars and breadcrumbs.

    PHPbookstackdocumentationlaravel
    Voir sur GitHub↗18,305
  • gyoogle/tech-interview-for-developerAvatar de gyoogle

    gyoogle/tech-interview-for-developer

    17,417Voir sur GitHub↗

    This project is a comprehensive technical interview preparation resource and computer science interview guide. It serves as an educational reference for developers to study core software engineering fundamentals and common coding patterns required for employment screenings. The repository provides detailed guides and references covering data structures and algorithms, networking and security, operating systems, and web development. It specifically focuses on the implementation and complexity analysis of sorting, searching, and graph algorithms. The material encompasses a wide breadth of comp

    Implements pre-order, in-order, post-order, and level-order tree traversal sequences.

    Javaalgorithmcomputer-sciencecs
    Voir sur GitHub↗17,417
  • suitenumerique/docsAvatar de suitenumerique

    suitenumerique/docs

    16,094Voir sur GitHub↗

    This project is a self-hosted documentation platform designed for collaborative knowledge base management. It provides a block-based editor that structures content as a tree of independent nodes, allowing for flexible layout composition and the creation of complex, nested document hierarchies. The platform distinguishes itself through an offline-first architecture that utilizes conflict-free replicated data types to maintain synchronization across multiple clients. This ensures that teams can continue editing content during network disconnections, with all changes merging automatically once c

    Organizes content into nested tree structures where document locations are determined by parent-child relationships.

    Pythonblocknotejscollaborativedjango
    Voir sur GitHub↗16,094
  • perfare/assetstudioAvatar de Perfare

    Perfare/AssetStudio

    15,474Voir sur GitHub↗

    AssetStudio is a desktop application designed for browsing, inspecting, and extracting assets from proprietary game engine archive files. It provides a comprehensive interface for navigating complex file structures to identify, preview, and export individual media components such as textures, audio, and 3D meshes. The software distinguishes itself through its ability to parse and reconstruct serialized object hierarchies and script data. By resolving assembly dependencies and traversing internal metadata trees, it translates proprietary game data into standard industry formats, including supp

    Traverses internal metadata trees to reconstruct serialized object hierarchies.

    C#unityunity3d
    Voir sur GitHub↗15,474
  • pointfreeco/swift-composable-architectureAvatar de pointfreeco

    pointfreeco/swift-composable-architecture

    14,726Voir sur GitHub↗

    This is a Swift state management framework and application logic library designed for building applications with a single source of truth and unidirectional data flow. It provides a Redux-inspired architecture that separates business logic from side effects and user interfaces to ensure predictable application behavior across multiple screens. The framework focuses on modularity by allowing complex features to be decomposed into smaller, isolated components. This enables the development of UI-independent business logic that can be extracted into separate modules to improve compilation speed a

    Represents the navigation history and active destinations as a state tree to enable deep linking and coordinated flow.

    Swiftarchitecturecompositionmodularity
    Voir sur GitHub↗14,726
  • nvim-treesitter/nvim-treesitterAvatar de nvim-treesitter

    nvim-treesitter/nvim-treesitter

    13,970Voir sur GitHub↗

    This project provides an integration of Tree-sitter into the Neovim editor to enable structural code analysis. It serves as a framework for structural code navigation, context-aware syntax highlighting, and the management of language-specific parsers. The system distinguishes itself through a multi-language injection handler that identifies and parses embedded languages within a single document. It uses a dedicated parser manager to install, update, and remove grammar definitions and their associated query files. The tool covers several capability areas including incremental text selection,

    Implements incremental selection, logical code folding and automated indentation based on concrete syntax trees.

    Tree-sitter Query
    Voir sur GitHub↗13,970
  • google-deepmind/mujocoAvatar de google-deepmind

    google-deepmind/mujoco

    13,957Voir sur GitHub↗

    MuJoCo is a physics simulation engine designed for the dynamics of multi-joint articulated structures. It provides a computational framework for calculating the forces, velocities, and physical interactions of complex models within a virtual environment, supporting research in robotics, biomechanics, and machine learning. The engine utilizes a constraint-based dynamics solver and recursive algorithms to manage the motion of articulated systems. It includes a native graphical interface for real-time visualization, allowing users to inspect physical behaviors and contact dynamics as they occur.

    Computes joint accelerations and forces by traversing the kinematic tree to achieve efficient simulation of complex articulated structures.

    C++mujocophysicsrobotics
    Voir sur GitHub↗13,957
Préc.12345…6Suivant
  1. Home
  2. Software Engineering & Architecture
  3. Tree Traversal Algorithms

Explorer les sous-tags

  • BFS and DFS TraversalsAlgorithms for visiting all nodes in a tree using breadth-first or depth-first search, with space complexity O(v) for BFS and O(h) for DFS. **Distinct from Tree Traversal Algorithms:** Distinct from Vertical Tree Traversals: covers standard BFS/DFS orderings rather than column-based ordering.
  • Centroid-Based Path AnalysisTechniques for processing all paths in a tree by recursively decomposing it into centroids. **Distinct from Tree Traversal Algorithms:** Focuses on centroid decomposition for path processing rather than general hierarchical navigation.
  • DOM Tree TraversersAlgorithms for navigating document object model hierarchies to extract specific nodes. **Distinct from Document Tree Traversers:** Focuses on data extraction and element discovery rather than mapping elements to drawing instructions.
  • Depth MetricsAlgorithms for calculating the maximum distance from the root to leaf nodes. **Distinct from Tree Traversal Algorithms:** Focuses specifically on depth calculation rather than general tree navigation or specific visual/kinematic traversals.
  • Document Tree Traversers11 sous-tagsAlgorithms for navigating document object model hierarchies to map elements to drawing instructions. **Distinct from Tree Traversal Algorithms:** Distinct from general tree traversal: focuses on mapping document structures to visual drawing primitives.
  • In-Order IteratorsAlgorithms that traverse a binary search tree in ascending order using an explicit stack, providing the next value on each call. **Distinct from Tree Traversal Algorithms:** Distinct from general Tree Traversal Algorithms: focuses specifically on iterative in-order traversal for BSTs, not all traversal types or recursive approaches.
  • Kinematic Tree Traversers2 sous-tagsAlgorithms for navigating hierarchical kinematic structures to compute joint forces and accelerations. **Distinct from Tree Traversal Algorithms:** Distinct from general tree traversal: focuses on the specific recursive computation of forces and accelerations in articulated robotic models.
  • Postorder TraversalsAlgorithms 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.
  • Regression TreesDecision tree models specialized for predicting continuous numerical values. **Distinct from Tree Traversal Algorithms:** Specifically implements regression trees for numerical prediction, unlike general tree traversal algorithms.
  • Reverse Level-Order TraversalsAlgorithms 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.
  • Structural ReconstructionsAlgorithms for rebuilding tree structures from traversal sequences. **Distinct from Tree Traversal Algorithms:** Focuses on the inverse operation of building a tree from data, rather than navigating an existing one.
  • Tree Element Metadata ProvidersSystems for attaching and retrieving metadata on specific tree nodes to coordinate actions between traversal levels. **Distinct from Document Tree Traversers:** Coordinates actions via metadata attachments during tree walking rather than mapping elements to visual drawing instructions.
  • Tree-Based Hierarchical Navigation8 sous-tagsOrganizes documentation into nested categories and sections to provide a logical structure for complex algorithmic and programming topics. **Distinct from Tree Traversal Algorithms:** Distinct from Tree Traversal Algorithms: focuses on UI navigation structures.
  • Tree-Based KnapsackCombines tree traversal with knapsack constraints to select optimal subsets while respecting hierarchical dependencies. **Distinct from Tree Traversal Algorithms:** Focuses on knapsack-specific tree DP, distinct from general tree traversal algorithms.
  • Vertical Tree TraversalsAlgorithms for traversing binary trees in vertical order, grouping nodes by horizontal column indices. **Distinct from Tree Traversal Algorithms:** Distinct from general Tree Traversal Algorithms: focuses on column-based ordering rather than depth-first or breadth-first patterns.