Array based Heap data structure composed of two Binary heaps (Max and Min). The heaps keep track of three statistics: minimum, maximum and median. The data structure supports efficient insertion, and it supports search and remove.
-
Notifications
You must be signed in to change notification settings - Fork 0
Array based Heap data structure composed of two Binary heaps (Max and Min). The heaps keep track of three statistics: minimum, maximum and median. The data structure supports efficient insertion, and it supports search and remove.
sean-custer/Median-Heap
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Array based Heap data structure composed of two Binary heaps (Max and Min). The heaps keep track of three statistics: minimum, maximum and median. The data structure supports efficient insertion, and it supports search and remove.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published