This package implements an AVL tree for key-value store.
An AVL tree is a self-balancing binary search tree.
| 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 | no |