⛱ What's Inside?

• New Data Structure: Min Heap
• Problems Added
  • K Largest elements in an array
  • K Smallest elements in an array
• Fixes
  • Change in logic flow of remove() for both the Heap classes
  • Change in logic of getMin() & getMax() of both the Heap classes
  • Removed splice() with pop()
  • Updated test cases
  • Constructors of both the classes accepts collection to build a Heap

Unit Tests

• Coverage > 97%

Heaps Coverage

🎉