Class DaryHeap<T>

A D-ary minMax heap implementation.

Inheritance
Object
DaryHeap<T>
Implements
Inherited Members
Namespace: Advanced.Algorithms.DataStructures
Assembly: Advanced.Algorithms.dll
Syntax
public class DaryHeap<T> : IEnumerable<T>, IEnumerable where T : IComparable
Type Parameters
Name Description
T

Constructors

| Improve this Doc View Source

DaryHeap(Int32, SortDirection, IEnumerable<T>)

Time complexity: O(n) when initial is provided otherwise O(1).

Declaration
public DaryHeap(int k, SortDirection sortDirection = SortDirection.Ascending, IEnumerable<T> initial = null)
Parameters
Type Name Description
Int32 k

The number of children per heap node.
SortDirection sortDirection
IEnumerable<T> initial

The initial items if any.

Fields

| Improve this Doc View Source

Count

Declaration
public int Count
Field Value
Type Description
Int32

Methods

| Improve this Doc View Source

Extract()

Time complexity: O(log(n) base K).

Declaration
public T Extract()
Returns
Type Description
T
| Improve this Doc View Source

GetEnumerator()

Declaration
public IEnumerator<T> GetEnumerator()
Returns
Type Description
IEnumerator<T>
| Improve this Doc View Source

Insert(T)

Time complexity: O(log(n) base K).

Declaration
public void Insert(T newItem)
Parameters
Type Name Description
T newItem
| Improve this Doc View Source

Peek()

Time complexity: O(1).

Declaration
public T Peek()
Returns
Type Description
T

Explicit Interface Implementations

| Improve this Doc View Source

IEnumerable.GetEnumerator()

Declaration
IEnumerator IEnumerable.GetEnumerator()
Returns
Type Description
IEnumerator

Implements