Binary Search Tree (BST)

Java implementation of a Binary Search Tree data structure.

Description

Program simulates emergency waiting room in the hospital. Node's key is based on a priority number from the Patient object.

• Functions implemented: insert, delete, transplant, search, min, in-order traversal.
• To be implemented: max, successor, predecessor, post-order traversal, pre-order traversal.

Usage

Terminal:

cd out/artifacts/JavaBinarySearchTree_jar
java -jar JavaBinarySearchTree.jar

Credit

Pseudo code was taken from Intro to Algorithms 3rd, Cormen.

Meta

Danil Kolesnikov – danil.kolesnikov@sjsu.edu

Distributed under the MIT license.