In addition implement these methods in each of the following classes
AVLTree, RedBlackTree: should produce a sorted array, via an in order traversal.
Heap: should just return a clone of the internal heap array
- The list classes
ListQueue, Stack: list.toArray()
PriorityQueue: heap.toArray()