A set based on an AVL Tree. An AVL Tree is a self-balancing binary search tree. It tracks the height of each node and performs internal rotations to maintain a height difference of at most 1 between each sibling pair.
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected