NewCircularQueue return a empty CircularQueue pointer.

NewLinkedQueue return a empty LinkedQueue pointer.

NewPriorityQueue return a pointer of PriorityQueue param `comparator` is used to compare values in the queue.

ArrayQueue implements queue with slice.

CircularQueue implements circular queue with slice, last index of CircularQueue don't contain value, so acturl capacity is capacity - 1.

LinkedQueue implements queue with link list.

PriorityQueue is a priority queue implemented by binary heap tree type T should implements Compare function in constraints.Comparator interface.