Assignments for CSI2110 Data Structures and Algorithms (Java)
- uses two heaps, links between nodes
- allows removal from either end
- removeMin/removeMax delegate to a single semi-polymorphic implementation, removeExtremum, to avoid duplication
Not an assignment, just playing around with how to implement pre/in/post-order iterators for binary search trees which only stores the previous node as state