Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).

Queue data structure for Go; SAY NO TO GITHUB

low level data type and utils in Golang.

A fast, disk-based BTree package with an extensive easy-to-use API optimized for large keys with many values.

A golang generic graph library that provides mathematical graph-theory and algorithms.

Embedded durable, extensive, concurrent safe, highly configurable, transactional LSM tree based key-value store package

A thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.

package skiprope is a rope-like data structure built on top of skiplists

Segment Tree in Go

A tree datastructure to store s2 cells and perform fast point in polygons lookup

Algorithm with Golang

algorithms, data structures and solved questions with golang (under development)

常用数据结构和排序算法

This repository contains different data structure implementation in golang

Sparse-Matrix Linked-List Go is a sparse matrix implementation in Go using a linked list. This is a data structure that stores only non-zero values in a matrix. This is useful when you have a lot of zeros in your matrix. This data structure is also useful when you want to perform operations on sparse matrices.

LeetCode problems' solutions using Go.

ABC - Always Be Coding

Implementations of various fundamental data structures as tree, stacks, queues etc. in Go

This is a simple Go program that checks if a given tree is complete or not. A tree is complete if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.

This is a simple Go program that traverses a tree in different ways. (Pre-order, In-order, Post-order, and Level-order)