solidstate-solidity
solidstate-solidity copied to clipboard
solidstate-network
AVL Tree
The AVL tree is a data structure that is efficiently sorted upon insertion and removal of nodes. This may be useful for DeFi data structures where 1) data must be ordered at all times 2) the cost of sorting the data structure should be amortized across user interactions. The AVL Tree should have a generalized implementation.
