From 4338456f9cbdbe4100d554239806efcae844ca48 Mon Sep 17 00:00:00 2001
From: Nicolas Renard <nicolas.renard.76@outlook.fr>
Date: Tue, 13 Dec 2016 16:09:28 +0100
Subject: [PATCH] Adding computing time (O(log n)) in help text.

---
 data_structures/heaps/Heap.java | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/data_structures/heaps/Heap.java b/data_structures/heaps/Heap.java
index 625bc05a9..02b2ba270 100644
--- a/data_structures/heaps/Heap.java
+++ b/data_structures/heaps/Heap.java
@@ -8,6 +8,8 @@ package heaps;
  * indicate how the tree shall be built. For instance, for a min-heap, the key of a node shall
  * be greater than or equal to its parent's and lower than or equal to its children's (the opposite rule applies to a
  * max-heap).</p>
+ * <p>All heap-related operations (inserting or deleting an element, extracting the min or max) are performed in
+ * O(log n) time.</p>
  * @author Nicolas Renard
  * 
  *