dataStructuresAndAlgorithms/dev.funkymuse.datastructuresandalgorithms.heap/Heap

Heap

interface Heap<T> : Collection<T>

Inheritors

Properties

Link copied to clipboard
abstract val count: Int
Link copied to clipboard
open val isEmpty: Boolean
Link copied to clipboard
open val isNotEmpty: Boolean

Functions

Link copied to clipboard
abstract fun getNthSmallestT(n: T): T?
Link copied to clipboard
abstract fun insert(element: T)
Link copied to clipboard
abstract fun isMinHeap(): Boolean
Link copied to clipboard
abstract fun merge(heap: AbstractHeap<T>)
Link copied to clipboard
abstract fun peek(): T?
Link copied to clipboard
abstract fun remove(): T?
Link copied to clipboard
abstract fun removeAt(index: Int): T?