avl-tree

GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

📚 collection of JavaScript and TypeScript data structures and algorithms for education purposes. Source code bundle of JavaScript algorithms and data structures book

A standalone and lightweight C library

100+ algorithms & data structures generically implemented in C#

Limit Order Book for high-frequency trading (HFT), as described by WK Selph, implemented in Python3 and C

c common functions library extracted from my open source project FastDFS. this library is very simple and stable. functions including: string, logger, chain, hash, socket, ini file reader, base64 encode / decode, url encode / decode, fast timer, skiplist, object pool etc. detail info please see the c header files.

Throw in the towel.

Go datastructures.

C library of key-value data structures.

A股订单簿工具，使用逐笔行情进行订单簿重建、千档快照发布、各档委托队列展示等，包括python模型和FPGA HLS实现。

Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.

Fast and memory-efficient immutable collections and helper data structures

This library provides various containers. Each container has utility functions to manipulate the data it holds. This is an abstraction as to not have to manually manage and reallocate memory.

Javascript Data Structure & TypeScript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree, AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue, Stack.

Code from Youtube Tutorial Series

👓 Fast AVL tree for Node and browser

Library of data containers and data structures for C programming language.

DataStructures and algorithms

A collection of Data Structures implemented in Swift.

High performance templated AVL tree using a fixed size array. Extensive test suite passing.