tree

type AggregateFunc[T constraints.Ordered] func(a, b T) T

type BST[T constraints.Ordered] interface {
	// Adds new elem to the tree, will not check if same val already exists
	Insert(T) *Node[T]

	// Returns the first node that matches
	Search(T) *Node[T]

	// In-order traversal of tree copied to slice
	ToSlice() []T

	// In-order traversal of tree, calling the func for each element visited
	Traverse(func(T))

	// Returns the largest value node that is smaller than or equal to the given value.
	Floor(T) *Node[T]

	// Returns the smallest value node that is larger than or equal to the given value.
	Ceiling(T) *Node[T]
}

type BinaryIndexTree struct {
	// contains filtered or unexported fields
}

type BinaryIndexTreeInterface interface {
	//add "val" at index "x"
	Update(x, val int)

	//returns the sum of first x elements
	Query(x int) int
}

type Node[T constraints.Ordered] struct {
	Left  *Node[T]
	Right *Node[T]
	Data  T
}

type SegmentTree[T constraints.Ordered] interface {
	UpdateRange(start, end int, updateFunc UpdateFunc[T])
	QueryRange(start, end int) T
}

type UpdateFunc[T constraints.Ordered] func(current T) T