https://github.com/vextroyer/heap

Heap data structure implementation on several languages
https://github.com/vextroyer/heap

data-structures heap

Last synced: 10 months ago
JSON representation

Heap data structure implementation on several languages

• Host: GitHub
• URL: https://github.com/vextroyer/heap
• Owner: Vextroyer
• Created: 2024-02-20T07:41:55.000Z (about 2 years ago)
• Default Branch: master
• Last Pushed: 2024-02-22T23:34:26.000Z (about 2 years ago)
• Last Synced: 2025-05-13T20:35:58.135Z (11 months ago)
• Topics: data-structures, heap
• Language: C#
• Homepage:
• Size: 2.93 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: Readme

Awesome Lists containing this project

README

          
On this repo there are implementations on several languages

of the heap data structure.

Maybe some algorithms using this structure will also e implemented on

the future, such as heapsort, and other structures such as the priority

queue.

A heap is a binary tree who mantains several invariants:

1- All the levels of the tree are complete except, perhaps, the last one.

2- Insertions are done from left to right on the last uncomplete level, or in

a new level if all the previous levels are complete.

Deletions works the same but from right to left.

3- For all child nodes y from node x holds that x R y where R is an order relation.

For example x <= y  (or x >= y)