datastructure

type Heap[T any] interface {
	Insert(value T)       // Insert or update an element in the heap
	Extract() (T, error)  // Extract the top element
	Peek() (T, error)     // Get the top element without removing it
	Remove(value T) error // Remove an element from the heap
	Len() int             // Get the size of the heap
}

type HeapType int

type Set[T comparable] interface {
	Add(value T) bool
	Remove(value T) bool
	Contains(value T) bool
	Values() []T
}