Add Heap

[Yangshun Tay]

• Heap class:
  • constructor()
  • size
  • isEmpty()
  • peek() // max or min depending on type of heap
  • insert()
  • extract()
  • static heapify<T>(arr: T[])
• should cover min heap
• should cover max heap

References

• https://docs.python.org/3.7/library/heapq.html
• https://medium.com/basecs/heapify-all-the-things-with-heap-sort-55ee1c93af82

[Alpha Barry]

hi @yangshun can I work on this ?

[Yangshun Tay]

Sure

…

On Wed, Jul 22, 2020, 12:29 PM Alpha Barry ***@***.***> wrote: hi @yangshun <https://github.com/yangshun> can I work on this ? — You are receiving this because you were mentioned. Reply to this email directly, view it on GitHub <#6 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AAKBCHLMCJYS6WLXMA6IOLTR4ZTJHANCNFSM4D6N2YVA> .

[Yangshun Tay]

Note that some part of #66 will cover this. Might make sense to add stuff on top of the existing Priority Queue data structure.

[Alpha Barry]

dully noted, I will check.
Thanks