# Aatree

It turns out red-black tree is not as fast as AA tree for immutable data. Due to its balancing/skewing more nodes need to be copied

Unlike C or python where you can dynamically link/unlink nodes from parent, recursively copying each node is expensive. Hence the performance boost of AA tree over Red Black tree.

## Installation

This package can be installed by adding `aatree` to your list of dependencies in `mix.exs`:

def deps do
  [{:aatree, "~> 0.1.0"}]

Documentation can be generated with [ExDoc](
and published on [HexDocs]( Once published, the docs can
be found at [](