awesome-repositories.com
Blog
awesome-repositories.com

Descubre los mejores repositorios open-source con nuestra búsqueda potenciada por IA.

ExplorarBúsquedas curadasAlternativas open-sourceSoftware autohospedableBlogMapa del sitio
ProyectoAcerca deCómo clasificamosPrensaServidor MCP
Aviso legalPrivacidadTérminos
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

3 repositorios

Awesome GitHub RepositoriesData Structure Tutorials

Educational content covering the implementation and theory of fundamental data structures.

Distinguishing note: No candidates matched; this is a learning resource focused on data structure theory.

Explore 3 awesome GitHub repositories matching education & learning resources · Data Structure Tutorials. Refine with filters or upvote what's useful.

Awesome Data Structure Tutorials GitHub Repositories

Encuentra los mejores repositorios con IA.Buscaremos los repositorios que mejor coincidan usando IA.
  • krahets/hello-algoAvatar de krahets

    krahets/hello-algo

    127,271Ver en GitHub↗

    This project is an educational resource and reference library designed to teach fundamental data structures and algorithmic problem-solving. It provides a structured pedagogical framework that organizes complex technical concepts into a logical progression, helping learners understand how data is organized, stored, and processed to solve computational problems efficiently. The repository distinguishes itself through a multi-language codebase that maintains parallel, consistent implementations of core algorithms and data structures across various programming languages. It bridges the gap betwe

    双向队列的实现与队列类似,可以选择链表或数组作为底层数据结构。 ### 1\. 基于双向链表的实现¶ 回顾上一节内容,我们使用普通单向链表来实现队列,因为它可以方便地删除头节点(对应出队操作)和在尾节点后添加新节点(对应入队操作)。 对于双向队列而言,头部和尾部都可以执行入队和出队操作。换句话说,双向队列需要实现另一个对称方向的操作。为此,我们采用“双向链表”作为双向队列的底层数据结构。 如图 5-8 所示,我们将双向链表的头节点和尾节

    Javaalgoalgorithmalgorithms
    Ver en GitHub↗127,271
  • geekxh/hello-algorithmAvatar de geekxh

    geekxh/hello-algorithm

    36,074Ver en GitHub↗

    This project is a comprehensive technical knowledge base and study guide focused on data structures, algorithms, and computer science fundamentals. It provides a curated collection of tutorials and educational resources designed to support technical growth and academic learning. The repository distinguishes itself through a heavy emphasis on visual learning, utilizing mind maps, diagrams, and illustrated breakdowns to explain complex algorithmic logic. It further supports career readiness by providing a repository of company-specific interview questions and real-world candidate experiences.

    Provides instructional guides for implementing and understanding core data structures like linked lists, trees, and graphs.

    Javaalgorithmsdynamic-programminginterview-questions
    Ver en GitHub↗36,074
  • keon/algorithmsAvatar de keon

    keon/algorithms

    25,269Ver en GitHub↗

    This repository is a structured educational archive of classic computer science algorithms and data structures implemented in Python. It serves as a reference library designed for study and technical skill development, providing clean, readable examples of fundamental computational techniques rather than production-ready software components. The project distinguishes itself through its idiomatic approach, utilizing native language features and standard library conventions to demonstrate algorithmic logic clearly. Each implementation is organized into a hierarchical directory structure that mi

    Data Structures — a named example documented in this learning resource.

    Pythonalgorithmalgorithmscompetitive-programming
    Ver en GitHub↗25,269
  1. Home
  2. Education & Learning Resources
  3. Data Structure Tutorials