Implement heap data structure and algorithms

Create implementations for heap data structure and related algorithms:

## Data structure implementations:
- Binary heap (min and max heap)
- Fibonacci heap
- Binomial heap
- D-ary heap
- Min-max heap

## Heap operations:
- Build heap in O(n)
- Heapify
- Extract min/max
- Decrease key
- Merge heaps

## Applications:
- Heap sort
- Priority queue
- Dijkstra's algorithm using heap
- K-th largest/smallest element
- Median in a stream
- Merge K sorted arrays

## Requirements:
- Provide detailed complexity analysis for all operations
- Create visualizations for heap operations
- Include comprehensive test cases
- Document practical use cases

This collection will cover heap data structures, which are essential for many efficient algorithms and priority-based operations.