Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added heap data structure in DSA #1575

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Added heap data structure in DSA #1575

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions Data Structures and Algorithm (DSA)/readme.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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>

Expand Down
Loading