From 369123dc13c68a6b6043f43b352a41532ca22c8f Mon Sep 17 00:00:00 2001 From: Achintya Sharma Date: Sun, 11 Sep 2022 20:26:57 +0530 Subject: [PATCH] Removed Heaps False Links --- README.md | 1 - 1 file changed, 1 deletion(-) diff --git a/README.md b/README.md index 182e35d..cab97de 100644 --- a/README.md +++ b/README.md @@ -810,7 +810,6 @@ if you can identify the runtime complexity of different algorithms. It's a super - visualized as a tree, but is usually linear in storage (array, linked list) - [ ] [Heap](https://en.wikipedia.org/wiki/Heap_(data_structure)) - [ ] [Introduction (video)](https://www.coursera.org/lecture/data-structures/introduction-2OpTs) - - [ ] [Naive Implementations (video)](https://www.coursera.org/learn/data-structures/lecture/z3l9N/naive-implementations) - [ ] [Binary Trees (video)](https://www.coursera.org/learn/data-structures/lecture/GRV2q/binary-trees) - [ ] [Tree Height Remark (video)](https://www.coursera.org/learn/data-structures/supplement/S5xxz/tree-height-remark) - [ ] [Basic Operations (video)](https://www.coursera.org/learn/data-structures/lecture/0g1dl/basic-operations)