Java implementation of a Red Black Tree data structure.
Program simulates emergency waiting room in the hospital. Node's key is based on a priority number from the Patient object.
- Functions implemented: insert, insert-fixup, left-rotate, right-rotate, delete, delete-fixup, transplant, search, min, in-order traversal, pre-order traversal.
Terminal:
cd out/artifacts/RedBlackTreeJava_jar
java -jar RedBlackTreeJava.jar
Pseudo code was taken from Intro to Algorithms 3rd, Cormen.
Danil Kolesnikov – danil.kolesnikov@sjsu.edu
Distributed under the MIT license.