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
·

166 dépôts

Awesome GitHub RepositoriesHierarchical Tree Structures

Data structures organized in parent-child node relationships, focusing on branching and recursive connectivity.

Explore 166 awesome GitHub repositories matching programming languages & runtimes · Hierarchical Tree Structures. Refine with filters or upvote what's useful.

Awesome Hierarchical Tree Structures 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.
  • facebook/reactAvatar de facebook

    facebook/react

    245,669Voir sur GitHub↗

    React est une bibliothèque JavaScript pour créer des interfaces utilisateur basées sur une architecture orientée composants et un flux de données unidirectionnel.

    Organizes application components into hierarchical tree structures to facilitate data flow and rendering analysis.

    JavaScriptjavascriptuifrontend
    Voir sur GitHub↗245,669
  • kdn251/interviewsAvatar de kdn251

    kdn251/interviews

    64,941Voir sur GitHub↗

    This project serves as a centralized knowledge base and study guide for mastering computer science fundamentals and technical interview preparation. It provides a structured collection of algorithmic implementations, data structure guides, and theoretical references designed to support professional development and problem-solving skills. The repository distinguishes itself through a taxonomy-based organization that maps complex concepts into a hierarchical structure. It standardizes the expression of abstract data structures and algorithms using a consistent programming language, with impleme

    Outlines the properties and mechanics of heap-based tree structures for efficient priority-based data management.

    Javaalgorithmalgorithm-challengesalgorithm-competitions
    Voir sur GitHub↗64,941
  • willmcgugan/richAvatar de willmcgugan

    willmcgugan/rich

    56,640Voir sur GitHub↗

    Rich is a Python terminal formatting library and user interface framework. It provides tools for rendering rich text, colors, and complex layouts within a terminal environment, including specialized formatters for markdown and source code syntax highlighting. The library distinguishes itself through high-level UI components such as tables with unicode borders, hierarchical tree views for nested data structures, and a system for building structured terminal user interfaces. It also includes a debugging visualizer for pretty-printing complex data and formatting error tracebacks. The capability

    Renders hierarchical tree views with guiding lines to represent nested data structures or file systems.

    Python
    Voir sur GitHub↗56,640
  • 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

    Transforms sorted arrays into height-balanced binary search trees via recursive middle-element selection.

    JavaScriptalgoalgorithmalgorithms
    Voir sur GitHub↗55,758
  • zadam/triliumAvatar de zadam

    zadam/trilium

    36,595Voir sur GitHub↗

    Trilium is a hierarchical personal knowledge base and digital garden tool designed to organize information into a tree of linked nodes. It functions as a JavaScript programmable wiki and a self-hosted note server, allowing users to maintain a private database of documents synchronized across multiple devices. The platform distinguishes itself through an embedded scripting engine for automating tasks and a REST API that exposes internal data and actions to external tools. Users can further extend the system by modifying the user interface layout and styling through a custom theme engine. The

    Visualizes conceptual relationships and narratives as networked nodes and edges through knowledge graph views.

    TypeScript
    Voir sur GitHub↗36,595
  • thealgorithms/c-plus-plusAvatar de TheAlgorithms

    TheAlgorithms/C-Plus-Plus

    34,361Voir sur GitHub↗

    This project is an educational repository and collection of algorithms implemented in C++. It provides a structured set of code examples covering mathematics, computer science, and physics for reference and learning. The collection includes implementations of data structures for managing hierarchical and linear data, such as binary search trees and AVL trees. It also features simulations of computer science concepts, including CPU scheduling and the resolution of combinatorial puzzles. The repository further covers cryptographic examples through the implementation of classic encryption and e

    Implements hierarchical tree structures using pointer-based nodes for efficient data retrieval.

    C++algorithmalgorithm-competitionsalgorithms-implemented
    Voir sur GitHub↗34,361
  • facebook/immutable-jsAvatar de facebook

    facebook/immutable-js

    33,060Voir sur GitHub↗

    This is a persistent data structure library for JavaScript that provides collections which prevent the direct mutation of objects and arrays. It serves as an immutable state management tool and functional programming utility, ensuring that data remains unchanged after creation to simplify change detection and state tracking. The library enables the maintenance of application state by producing new versions of data structures during updates. It focuses on efficient data comparison by checking actual content instead of memory references and supports a functional programming workflow to prevent

    Uses structural sharing to minimize memory overhead when producing new versions of data structures.

    TypeScript
    Voir sur GitHub↗33,060
  • immutable-js/immutable-jsAvatar de immutable-js

    immutable-js/immutable-js

    33,060Voir sur GitHub↗

    Immutable.js is a library of persistent data structures and a functional state management toolkit. It provides a collection of immutable objects and arrays that prevent direct mutation to ensure predictable state management in JavaScript applications. The library utilizes structural sharing to efficiently create new versions of data without full copying and implements lazy sequence processing to chain data transformations that execute only when values are requested. It also supports batch mutation processing, allowing multiple changes to be applied to a temporary mutable copy before returning

    Employs structural sharing to reuse unchanged nodes between versions of persistent data structures, minimizing memory overhead.

    TypeScript
    Voir sur GitHub↗33,060
  • 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

    Organizes complex documents into logical, hierarchical trees to preserve structure and improve retrieval accuracy.

    Pythonagentagentic-aiai
    Voir sur GitHub↗33,103
  • kodecocodes/swift-algorithm-clubAvatar de kodecocodes

    kodecocodes/swift-algorithm-club

    29,099Voir sur GitHub↗

    This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to

    Implements a general binary tree structure where each node has at most two children.

    Swiftalgorithmsdata-structuresswift
    Voir sur GitHub↗29,099
  • immerjs/immerAvatar de immerjs

    immerjs/immer

    28,957Voir sur GitHub↗

    Immer is an immutable state management library used to create new versions of data structures. It allows the production of new state by mutating a temporary draft instead of using manual object spreading. The project implements structural sharing to reuse unchanged parts of a data tree between versions, which reduces memory consumption. It also functions as a JSON patch generator to calculate and output the differences between two state versions. To ensure data integrity, the library includes a state mutation protector that freezes data structures to detect and prevent accidental modificatio

    Implements structural sharing to reuse unchanged nodes between state versions, minimizing memory consumption.

    JavaScriptimmutableimmutablesreducer
    Voir sur GitHub↗28,957
  • mweststrate/immerAvatar de mweststrate

    mweststrate/immer

    28,957Voir sur GitHub↗

    Immer is an immutable state management library for JavaScript that enables the creation of new versions of state trees. It functions as a state container that uses a proxy-based handler to ensure data immutability. The library utilizes a copy-on-write mechanism and a draft-based mutation model. This allows users to write mutating code on a temporary proxy, which the system then uses to produce a new immutable result while keeping the original state unchanged. The project covers immutable state management and complex object cloning to facilitate predictable state transitions. These capabiliti

    Utilizes structural sharing to reuse unchanged branches of the state tree, minimizing memory allocations.

    JavaScript
    Voir sur GitHub↗28,957
  • 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

    Combines tree decomposition and segment trees to perform efficient dynamic programming on tree structures.

    TypeScriptacm-icpcacm-icpc-handbookalgorithms
    Voir sur GitHub↗26,176
  • eip-work/kuboard-pressAvatar de eip-work

    eip-work/kuboard-press

    25,071Voir sur GitHub↗

    Kuboard-press is a visual management interface for Kubernetes clusters that enables the orchestration of workloads and system objects without manual text file editing. It provides a centralized dashboard for importing and monitoring multiple clusters, using a visual interface to manage namespaces and containerized workloads. The project differentiates itself through hierarchical microservices visualization, which maps flat cluster workloads into a layered structure to represent architectural relationships. It also includes dedicated container operation tools for accessing logs, opening intera

    Maps flat cluster workloads into a layered visual structure to represent microservice architectural relationships.

    JavaScriptdockerk8skubernetes
    Voir sur GitHub↗25,071
  • wangzheng0822/algoAvatar de wangzheng0822

    wangzheng0822/algo

    23,159Voir sur GitHub↗

    This project is a data structures and algorithms library providing a collection of fifty standard code implementations for managing data and solving common computational problems. It serves as an algorithm implementation reference and study resource for educational use. The codebase covers graph theory implementations for modeling networks and performing searches, as well as string pattern matching libraries for the retrieval of character sequences. It includes a collection of hierarchical data structures, such as binary search trees and priority heaps, and provides optimized solutions for dy

    Builds binary search trees to support efficient sorted insertion, deletion, and traversal.

    Python
    Voir sur GitHub↗23,159
  • 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

    Scans the content hierarchy for data inconsistencies and automatically resolves structural errors.

    Pythoncmsdjangohacktoberfest
    Voir sur GitHub↗20,366
  • brendangregg/flamegraphAvatar de brendangregg

    brendangregg/FlameGraph

    19,307Voir sur GitHub↗

    FlameGraph is a performance profiling and visualization toolkit designed to identify bottlenecks in software execution. It functions as a processing engine that transforms raw stack trace samples into interactive, hierarchical diagrams. By representing aggregated execution frequency as nested rectangles, the tool allows developers to visualize hot code paths and analyze system behavior across both kernel and user-space environments. The project distinguishes itself through its ability to perform differential profile analysis, which highlights performance regressions or improvements by compari

    Maps parent-child connections between system processes or data elements as directed node graphs.

    Perl
    Voir sur GitHub↗19,307
  • meta-llama/llama-cookbookAvatar de meta-llama

    meta-llama/llama-cookbook

    18,375Voir sur GitHub↗

    This project is a collection of implementation guides, recipes, and developer resources for building applications with Llama models. It serves as a comprehensive kit for developing autonomous agents, establishing retrieval-augmented generation systems, and executing model fine-tuning. The resource provides specific patterns for multimodal workflows that process text, images, and audio. It includes specialized guidance on adapting pre-trained model weights for targeted tasks and implementing tool-calling orchestration to connect models with external APIs and functions. The codebase covers a b

    Transforms literary analysis into structured graph data to map character and plot connections.

    Jupyter Notebookaifinetuninglangchain
    Voir sur GitHub↗18,375
  • nim-lang/nimAvatar de nim-lang

    nim-lang/Nim

    18,071Voir sur GitHub↗

    Nim is a statically typed, compiled systems programming language designed for high performance and cross-platform development. It translates high-level source code into C, C++, or JavaScript, allowing developers to produce efficient native binaries or web-compatible scripts from a single codebase. The language emphasizes a clean, indentation-based syntax that simplifies code hierarchy while maintaining the power of a full-featured systems language. What distinguishes Nim is its robust metaprogramming framework, which allows developers to inspect, modify, and generate code structures during th

    Declare mutually dependent types within a single section to represent complex structures like trees or graphs.

    Nimcompilerefficienthacktoberfest
    Voir sur GitHub↗18,071
  • rust-lang/bookAvatar de rust-lang

    rust-lang/book

    17,930Voir sur GitHub↗

    The Rust Programming Language Book is the official technical guide and educational resource for the Rust language. It provides a comprehensive walkthrough of the language's design, focusing on its core identity as a systems programming language that enforces memory safety and high-performance execution without the need for a garbage collector. The project is distinguished by its focus on ownership, borrowing, and lifetime tracking, which allow the compiler to verify memory safety and thread safety at compile time. It covers the language's unique approach to zero-cost abstractions, including t

    Supports heap-based storage for recursive types and data with unknown sizes at compile time.

    Rustbookmdbookrust
    Voir sur GitHub↗17,930
Préc.123456…9Suivant
  1. Home
  2. Programming Languages & Runtimes
  3. Programming Utilities
  4. Data Structure and Type Helpers
  5. Data Structures
  6. Hierarchical Tree Structures

Explorer les sous-tags

  • Binary Search Trees13 sous-tagsBinary tree structures that maintain specific ordering properties to facilitate efficient data retrieval and management.
  • Centroid TreesHierarchical structures built from centroids to optimize distance queries in trees. **Distinct from Hierarchical Tree Structures:** Specifically refers to the construction of centroid trees for distance queries, not general hierarchical structures.
  • Credential Tree StructuresHierarchical tree data structures for organizing credentials into groups and subgroups with navigation and search. **Distinct from Hierarchical Tree Structures:** Distinct from Hierarchical Tree Structures: specifically designed for credential organization with KeePass XML schema mirroring.
  • Fenwick TreesTree-based data structures, also known as binary indexed trees, designed for efficient range queries and updates.
  • HeapsSpecialized tree-based data structures that satisfy specific heap properties for efficient priority-based element access.
  • Hierarchical Tree Visualizers12 sous-tagsVisual components for rendering and navigating nested parent-child relationships. **Distinct from Hierarchical Tree Structures:** Distinct from data structures: focuses on the visual representation of hierarchies.
  • Relationship Graph Visualizers4 sous-tagsTools for mapping parent-child connections between system elements as directed node graphs. **Distinct from Hierarchical Tree Structures:** Distinct from Hierarchical Tree Structures: focuses on visual mapping of relationships rather than the data structure itself.
  • Segment Trees4 sous-tagsTree data structures used for storing intervals or segments to enable efficient range-based queries.
  • Source Code Abstract Syntax Trees8 sous-tagsTree-based representations of source code structures used for program generation. **Distinct from Hierarchical Tree Structures:** Distinct from general hierarchical tree structures by specifically modeling Java language elements as a tree of objects.
  • Spatial HierarchiesNested tree structures used to organize physical spaces and items within a larger site. **Distinct from Hierarchical Tree Structures:** Specifically manages spatial/architectural nesting rather than generic data structures or workflow nodes.
  • Structural Sharing1 sous-tagTechniques for reusing unchanged nodes between versions of a persistent data structure. **Distinct from Hierarchical Tree Structures:** Specifically refers to the memory optimization technique of sharing nodes, not just the general hierarchy.
  • Supervision TreesHierarchical process structures where supervisors monitor and automatically restart failed child processes. **Distinct from Hierarchical Tree Structures:** Focuses on process recovery and fault management rather than general hierarchical data storage.
  • Tree Structure RepairersUtilities for scanning and resolving structural inconsistencies in hierarchical database trees. **Distinct from Hierarchical Tree Structures:** Distinct from hierarchical tree structures: focuses on repair and data integrity rather than the structure itself.
  • Tree-Based Window Layouts1 sous-tagOrganization of screen space using hierarchical parent-child nodes to subdivide areas into branches and stacks. **Distinct from Hierarchical Tree Structures:** Specializes general Hierarchical Tree Structures for the purpose of window management and layout subdivision.
  • TreesUndirected, connected, and acyclic graph structures used for organizing hierarchical data.
  • Visual Chart ExportsUtilities for saving rendered chart visualizations as image or document files. **Distinct from Hierarchical Tree Visualizers:** Focuses on exporting the visual rendered state (PNG/PDF) rather than the underlying data structure