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

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

Gomap makes maps in Go even easier! 🗺️

Data structure, Algorithm and Design pattern written in golang.

practicing,leetcode,using go,python etc.

A piece table is a data structure typically used to represent a series of edits on a text document.

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

Datastruct and Algorithms in Golang

An unordered multiset implementation

low level data type and utils in Golang.

some data structs for go, such as set, tree, linkedlist, queue, stack...

This is a Go implementation of the BST data structure with a few of the most common operations. The algorithms code should be easy to understand. BST Tree is a binary tree in which the value of each node is greater than or equal to any value stored in the left sub-tree, and less than or equal to any value stored in the right sub-tree.

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)

This is a simple Go program that converts a general tree to a binary tree.

Implementation of a binary tree in Go. A Binary Tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A node with no children is called a leaf node. A node cannot have more than two children.

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.

Implentation of a general tree in Go Programming Language. A general tree is a tree data structure in which each node can have an arbitrary number of children. We are storing children in an array.

This is a simple implementation of a queue using a linked-list in Go. This is a good example of how to use a linked-list in Go.

This is a simple implementation of a stack using a linked-list in Go. (Data Structure and Algorithms)