4 个仓库
A collection of balanced and unbalanced search tree implementations including Red-Black, Splay, and B-Trees.
Distinct from Tree Data Structures: Groups various specific search tree types together under educational tree data structures
Explore 4 awesome GitHub repositories matching education & learning resources · Search Tree Implementations. Refine with filters or upvote what's useful.
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 wide variety of search trees including Red-Black, Splay, and B-Trees.
This project is a computer science educational resource and library providing implementations of data structures and algorithms in JavaScript. It serves as an algorithm implementation reference and a toolkit for building foundational data containers, including a collection of sorting algorithms and a guide for learning time and space complexity. The project differentiates itself by pairing class-based implementations with Big O analysis to illustrate asymptotic complexity. It includes a non-linear data structure toolkit featuring self-balancing trees, hash maps, and graphs, alongside comparis
Stores key-value pairs in sorted order using balanced trees to guarantee logarithmic lookups.
This project is a comprehensive collection of C++ libraries and toolkits providing reference implementations for data structures, graph algorithms, and bitwise logic. It serves as a C++ algorithm reference containing over 180 solved coding problems and a specialized toolkit for competitive programming. The repository distinguishes itself through extensive low-level bit manipulation libraries for parity checks, endianness detection, and XOR-based logic. It also provides a wide array of reference solutions for complex algorithmic challenges involving backtracking, graph theory, and dynamic prog
Implements search operations to locate specific values and identify extreme elements within a tree.
klib 是一个全面的 C 标准库扩展和数据结构工具包。它为独立的 C 应用程序提供了一套基础工具,涵盖内存管理、数据组织和通用实用函数。 该项目具备生物信息学序列分析的专项能力,包括解析 FASTA、FASTQ 和 Newick 格式,以及实现 Smith-Waterman 序列比对和隐马尔可夫模型(HMM)。它还包含用于数值计算和表达式求值的数学库,以及用于随机访问远程数据的轻量级 HTTP 和 FTP 客户端。 该工具包涵盖了广泛的高性能计算原语,包括多线程模型、线性时间后缀数组构建和优化排序算法。它实现了多种高效的数据索引结构,如开放寻址哈希表、B 树和侵入式 AVL 树,并由基于内存池的序列管理提供支持。 其他实用工具还包括 JSON 数据解析和命令行参数解析。
Implements balanced search trees, including B-trees and intrusive AVL trees, to enable efficient data lookup.