Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-30 04:36:08 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
marina 2023-08-02 13:52:15 -07:00 committed by GitHub
parent 29b7948275
commit c04d598bfa
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
heaps/README.md
View File

@ -10,7 +10,7 @@
<br> <br>
* 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: * a heap is a binary tree with these properties:
* it must have all of **its nodes in a specific order**, and * it must have all of **its nodes in a specific order**, and