1 files changed, 1 insertions, 1 deletions

diff --git a/src/stable/heap.h b/src/stable/heap.h
index 2fcd387..d197b91 100644
--- a/src/stable/heap.h
+++ b/src/stable/heap.h
@@ -191,7 +191,7 @@ namespace Bu
      * objects enqueued must support less-than-comparison.  Then every time an
      * item is dequeued it is always the least item in the heap.  The heap
      * operates using a binary tree for storage, which allows most operations
-     * to be very fast.  Enqueueing and dequeueing are both O(log(N)) operatoins
+     * to be very fast.  Enqueueing and dequeueing are both O(log(N)) operations
      * whereas peeking is constant time.
      *
      * This heap implementation allows iterating, however please note that any