Create a PriorityQueue class based on VisualizationApp. There is no
visualization yet built for this data structure but it shares similarities
with OrderedArray.py and Queue.py.
The PriorityQueue should accept short text or numeric values, maybe 8
characters max. Numeric values can be stored internally as strings and
compared as strings.
Implement the animated methods for:
New Queue (empty with a given max capacity)
Insert (at rear)
Remove (from front)
Peek (at front)
Clicking on an item in the queue should update the argument for the
Insert operation to be that item's value.
Create a PriorityQueue class based on VisualizationApp. There is no visualization yet built for this data structure but it shares similarities with OrderedArray.py and Queue.py.
The PriorityQueue should accept short text or numeric values, maybe 8 characters max. Numeric values can be stored internally as strings and compared as strings.
Implement the animated methods for:
Clicking on an item in the queue should update the argument for the Insert operation to be that item's value.