From c04d598bfaaed7f140e3ff2bbec73c869385c1e3 Mon Sep 17 00:00:00 2001 From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com> Date: Wed, 2 Aug 2023 13:52:15 -0700 Subject: [PATCH] Update README.md --- heaps/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/heaps/README.md b/heaps/README.md index 8c967a6..1c93473 100644 --- a/heaps/README.md +++ b/heaps/README.md @@ -10,7 +10,7 @@
-* heap is a data structure capable of giving you the smallest (or the largest) element in constant time, while adding or removing the smallest (or the largest) element on logarithmic time. +* heap is a data structure capable of giving you the smallest (or the largest) element in constant time, while adding or removing the smallest (or the largest) element on logarithmic time. however, adding a new element can be `O(N)`. * a heap is a binary tree with these properties: * it must have all of **its nodes in a specific order**, and