I need an AVL binary tree implemented in solidity for maintaining a list of addresses sorted by a value while having a O(logn) runtime for inserts, deletes and looking up the greatest and least values. Has anyone implemented such a thing in solidity?
Also -- is there some package / library repository for useful data structures or boilerplate contracts?
https://en.wikipedia.org/wiki/AVL_tree
Comments
imho, this looks very promising:
- contract
- git repo
It's not exactly what I need, but it looks like a very nice place to start. (GPLv3)