Expand description

AA-Tree implementation in Rust.

An AA-Tree is a self-balancing binary search tree based on a RedBlack-Tree with a simplified self-balancing logic that should benefit performance.

Modules

Iterator implementations for AATreeSet and AATreeMap.
Low-level implementation of an AA tree. You shouldn’t have to use this directly; instead, use the implementations in AATreeSet and AATreeMap.

Structs

A set based on an AA-Tree.