Spring 2016
Java, JUnit
The purpose of the project is to implement a complete binary tree and an adaptable heap priority queue. The complete binary tree extends the LinkedBinaryTree and uses a NodeDeque, while the adaptable heap priority queue uses my implementation of the complete binary tree.
Demo of project. Note: no code is shown to abide by Brown University CS16's course policy.
