d-ary heaps

Visualization of d-ary heaps in D3 by Robin C. Ladiges

degree d
node count n

clicking behavior:
change value to
remove node

auto step

Minimum: Ο(1)
Maximum: Ο(n)
Insert: Ο(log_d n)
Remove: Ο(d·log_d n)
Decrease Value: Ο(log_d n)
Increase Value: Ο(d·log_d n)