Arsenalist/Red-Black-Tree-Java-Implementation
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
This is an implementation of a Red-Black Tree in Java: http://en.wikipedia.org/wiki/Red%E2%80%93black_tree A red.black tree is a type of self-balancing binary search tree, a data structure used in computer science, typically to implement associative arrays. I used this to store a large set of data that had to be "auto completed" over, and I didn't have the option to use a database. This guaranteed that the height of the tree stayed sane. This uses Java generics so it can be applied to any object.
About
A Red Black Tree Implementation in Java
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published