diff --git a/src/maxPriorityQueue.d.ts b/src/maxPriorityQueue.d.ts
index bce4f16..fd8db9c 100644
--- a/src/maxPriorityQueue.d.ts
+++ b/src/maxPriorityQueue.d.ts
@@ -1,6 +1,6 @@
 import { MaxHeap, IGetCompareValue } from '@datastructures-js/heap';
 
-export class MaxPriorityQueue<T> {
+export class MaxPriorityQueue<T> implements Iterable<T> {
   constructor(getCompareValue?: IGetCompareValue<T>, heap?: MaxHeap<T>);
   [Symbol.iterator](): Iterator<T, any, undefined>;
   size(): number;
diff --git a/src/minPriorityQueue.d.ts b/src/minPriorityQueue.d.ts
index 6770161..8f52bf9 100644
--- a/src/minPriorityQueue.d.ts
+++ b/src/minPriorityQueue.d.ts
@@ -1,6 +1,6 @@
 import { MinHeap, IGetCompareValue } from '@datastructures-js/heap';
 
-export class MinPriorityQueue<T> {
+export class MinPriorityQueue<T> implements Iterable<T> {
   constructor(getCompareValue?: IGetCompareValue<T>, heap?: MinHeap<T>);
   [Symbol.iterator](): Iterator<T, any, undefined>;
   size(): number;
diff --git a/src/priorityQueue.d.ts b/src/priorityQueue.d.ts
index ba77684..e692cdf 100644
--- a/src/priorityQueue.d.ts
+++ b/src/priorityQueue.d.ts
@@ -1,6 +1,6 @@
 import { ICompare } from '@datastructures-js/heap';
 
-export class PriorityQueue<T> {
+export class PriorityQueue<T> implements Iterable<T> {
   constructor(compare: ICompare<T>, values?: T[]);
   [Symbol.iterator](): Iterator<T, any, undefined>;
   size(): number;