Damoy / priority-queues

Tree data structures (Heap, AVL, Red-black) used as priority queues.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Java priority queue implementations

Tree data structures (Heap, AVL, Red-black) used as priority queues.

Authors

  • BENZA Amandine
  • FORNALI Damien

2018 - Nice Sophia-Antipolis University
Software Architecture Master degree students

About

Tree data structures (Heap, AVL, Red-black) used as priority queues.

License:GNU General Public License v3.0


Languages

Language:Java 100.0%