https://github.com/maolonglong/llrb

🌴 LLRB-Tree provides a simple, ordered, in-memory data structure for Go programs
https://github.com/maolonglong/llrb

data-structure go red-black-tree

Last synced: about 2 months ago
JSON representation

🌴 LLRB-Tree provides a simple, ordered, in-memory data structure for Go programs

• Host: GitHub
• URL: https://github.com/maolonglong/llrb
• Owner: maolonglong
• License: mit
• Created: 2023-08-28T05:45:24.000Z (about 2 years ago)
• Default Branch: main
• Last Pushed: 2024-12-07T07:46:16.000Z (10 months ago)
• Last Synced: 2024-12-26T19:41:49.897Z (10 months ago)
• Topics: data-structure, go, red-black-tree
• Language: Go
• Homepage: https://pkg.go.dev/github.com/maolonglong/llrb
• Size: 43 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# LLRB-Tree implementation for Go

[![PkgGoDev](https://pkg.go.dev/badge/github.com/maolonglong/llrb)](https://pkg.go.dev/github.com/maolonglong/llrb)

This repository contains an implementation of a Left-Leaning Red-Black (LLRB) tree in Go. The LLRB tree is a self-balancing binary search tree that provides efficient operations for insertion, deletion, and search.

For more information and usage examples, please refer to the [GoDoc documentation](https://pkg.go.dev/github.com/maolonglong/llrb).