https://github.com/somebadcode/avltree
AVL tree, a balancing search tree
https://github.com/somebadcode/avltree
avl avl-tree avl-tree-implementation avl-tree-implementations avltree balancing balancing-tree bst btree go golang search search-tree tree
Last synced: about 1 month ago
JSON representation
AVL tree, a balancing search tree
- Host: GitHub
- URL: https://github.com/somebadcode/avltree
- Owner: somebadcode
- License: bsd-3-clause
- Created: 2022-10-10T21:08:38.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-08-29T19:12:24.000Z (8 months ago)
- Last Synced: 2025-01-27T06:44:40.259Z (3 months ago)
- Topics: avl, avl-tree, avl-tree-implementation, avl-tree-implementations, avltree, balancing, balancing-tree, bst, btree, go, golang, search, search-tree, tree
- Language: Go
- Homepage:
- Size: 14.6 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
# AVL tree for key-value store
This package implements an AVL tree for key-value store.
## What is an AVL tree?
An AVL tree is a self-balancing binary search tree.
## Features
| Feature | Implemented |
|-------------------------|-------------|
| Insertion | yes |
| Deletion | yes |
| Searching | yes |
| Get inorder successor | yes |
| Get inorder predecessor | yes |
| Inorder traversal | yes |
| Preorder traversal | yes |
| Postorder traversal | yes |
| Balancing | yes (AVL) |
Serialization of the tree will not be implemented since the key and value can be an arbitrary type. It would be better
for the caller to implement the serialization that fits the use case the best.