Added heap data structure in DSA

jfmartinz · Jul 8, 2024 · ba35107 · ba35107
1 parent dcfdb71
commit ba35107
Showing 1 changed file with 4 additions and 0 deletions.
diff --git a/Data Structures and Algorithm (DSA)/readme.md b/Data Structures and Algorithm (DSA)/readme.md
@@ -101,6 +101,10 @@ Let's make coding fun and exciting! 🚀.</td>
   <tr>
   <td><a href="https://youtu.be/bvWVs0tJUOY?si=49dbm82Ck8_V2E70"> Graph </a></td>
   <td> A Graph is a non-linear data structure consisting of a finite set of vertices(or nodes) and a set of edges that connect a pair of nodes. Another important non-linear data structure is the graph. It is similar to the Tree data structure, with the difference that there is no particular root or leaf node, and it can be traversed in any order. </td>
+  </tr>
+   <tr>
+  <td><a href="https://www.youtube.com/playlist?list=PLzjZaW71kMwTF8ZcUwm9md_3MvtOfwGow"> Heap </a></td>
+  <td> A heap is a specialized tree-based data structure that satisfies the heap property: in a max-heap, each parent node is greater than or equal to its children; in a min-heap, each parent node is less than or equal to its children. </td>
   </tr>
   </table>