Homework 4 (Due date: Oct 15 Friday)

Files that you need to write

UnCheckedList

HeapPriorityQueue

LinkedBinaryTree

---

UnCheckedList – rewrite it using a heap instead of vector from Homework 2

IMPORTANT: Name the object of HeapPriorityQueue as UnChecked_list

HeapPriorityQueue UnChecked_list

---

HeapPriorityQueue – implements PriorityQueue

Variables that you need

· LinkedBinaryTree tree

· Position last

· Comparator comparator

---

LinkedBinaryTree – implements BinaryTree

Variables that you need

· Position root

· int size

Implements all methods, which are in BinaryTree class, in LinkedBinaryTree

Implements preordertraverse method (Look at driver)