https://github.com/0b01/aatree
AA Tree in elixir
https://github.com/0b01/aatree
Last synced: 8 months ago
JSON representation
AA Tree in elixir
- Host: GitHub
- URL: https://github.com/0b01/aatree
- Owner: 0b01
- Created: 2017-05-28T20:41:44.000Z (about 9 years ago)
- Default Branch: master
- Last Pushed: 2017-05-28T20:45:08.000Z (about 9 years ago)
- Last Synced: 2024-10-18T15:17:18.876Z (almost 2 years ago)
- Language: Elixir
- Size: 4.88 KB
- Stars: 5
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 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`:
```elixir
def deps do
[{:aatree, "~> 0.1.0"}]
end
```
Documentation can be generated with [ExDoc](https://github.com/elixir-lang/ex_doc)
and published on [HexDocs](https://hexdocs.pm). Once published, the docs can
be found at [https://hexdocs.pm/aatree](https://hexdocs.pm/aatree).