awesome-repositories.com
المدونة
MCP
awesome-repositories.com

اكتشف أفضل مستودعات المصادر المفتوحة باستخدام بحث مدعوم بالذكاء الاصطناعي.

استكشفعمليات بحث منسقةبدائل مفتوحة المصدربرمجيات ذاتية الاستضافةالمدونةخريطة الموقع
المشروعخادم MCPحولكيفية ترتيب النتائجالصحافة
قانونيالخصوصيةالشروط
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 مستودعات

Awesome GitHub RepositoriesTrie Key Insertion

Logic for inserting character sequences into a trie while reusing shared prefixes.

Distinct from Trie Data Structures: Focuses on the insertion operation specifically, rather than the general trie structure.

Explore 2 awesome GitHub repositories matching software engineering & architecture · Trie Key Insertion. Refine with filters or upvote what's useful.

Awesome Trie Key Insertion GitHub Repositories

اعثر على أفضل المستودعات باستخدام الذكاء الاصطناعي.سنبحث عن أفضل المستودعات المطابقة باستخدام الذكاء الاصطناعي.
  • kodecocodes/swift-algorithm-clubالصورة الرمزية لـ kodecocodes

    kodecocodes/swift-algorithm-club

    29,099عرض على 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 efficient trie insertion by leveraging common prefixes for character sequences.

    Swiftalgorithmsdata-structuresswift
    عرض على GitHub↗29,099
  • teivah/algodeckالصورة الرمزية لـ teivah

    teivah/algodeck

    5,819عرض على GitHub↗

    Algodeck is an open-source collection of flash cards designed for reviewing algorithms, data structures, and system design concepts, specifically curated for technical interview preparation. The project organizes knowledge into atomic question-and-answer pairs and incorporates spaced repetition scheduling to optimize long-term memory retention. The flash card catalog covers a broad range of computer science topics, including classic sorting algorithms like quicksort and mergesort, data structure operations for arrays, trees, heaps, tries, and graphs, as well as bit manipulation techniques for

    Explains trie data structure operations including key insertion and search.

    HTML
    عرض على GitHub↗5,819
  1. Home
  2. Software Engineering & Architecture
  3. Trie Data Structures
  4. Trie Key Insertion

استكشف الوسوم الفرعية

  • Trie Key SearchesOperations that check for the existence of a key in a trie by traversing character nodes in O(k) time. **Distinct from Trie Key Insertion:** Distinct from Trie Key Insertion: searches for existing keys rather than adding new ones, using the same prefix traversal pattern.