[![crates.io](http://meritbadge.herokuapp.com/vebtrees)](https://crates.io/crates/vebtrees)
[![docs.rs](https://docs.rs/vebtrees/badge.svg)](https://docs.rs/vebtrees)
[![Build Status](https://travis-ci.org/JMurph2015/rust-vebtrees.svg?branch=master)](https://travis-ci.org/JMurph2015/rust-vebtrees)
[![Built with Spacemacs](https://cdn.rawgit.com/syl20bnr/spacemacs/442d025779da2f62fc86c2082703697714db6514/assets/spacemacs-badge.svg)](http://spacemacs.org)
# vebtrees
__A Rust Implementation of Van Emde Boas Trees__

## Introduction
Van Emde Boas trees are cool data strucutures because they can implement all associative array functions
in O(loglog(M)) where M is the maximum capacity of the tree.


## Acknowlegdements
 Cormen, Thomas H., et al. Introduction to Algorithms, 3rd Edition. MIT Press, 2009.

 “Van Emde Boas Tree.” Wikipedia, 2017, en.wikipedia.org/wiki/Van_Emde_Boas_tree.