Abstract Data Type in Go
-
Updated
Jan 25, 2023 - Go
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
Abstract Data Type in Go
Concurrent Cache - Concurrent-Safe Cache for Go
A generic Blockchain-like data structure experiment
Quick references on how to do things with Golang
This is a simple Go program that converts a general tree to a binary tree.
Code from the coding competitions I participated
This is a simple implementation of a stack using a linked-list in Go. (Data Structure and Algorithms)
A bit vector implementation in go
A generic AVL tree for Go.
Merkle Patricia tries provide a cryptographically authenticated data structure that can be used to store all (key, value) bindings
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.
some data structs for go, such as set, tree, linkedlist, queue, stack...