Algorithms.DataStructures

Data Structures

This library contains implementations of various different data structures. The full list of implemented data structures can be found below.

Data Structures

Heaps

Name	Min	Delete	Insert
Binary	$\Theta(1)$	$\Theta(\log n)$	$\mathcal O(\log n)$
Binomial	$\Theta(1)$	$\Theta(\log n)$	$\Theta(1)$
D-heap	$\Theta(1)$	$\mathcal O(d\log_dn)$	$\mathcal O(\log_dn)$
Leftist	$\Theta(1)$	$\Theta(\log n)$	$\Theta(\log n)$
Weak	$\Theta(1)$	$\mathcal O(\log n)$	$\mathcal O(\log n)$

Trees

Name	Traversable
Binary	true
Binomial	false
B-Tree	true
Cartesian	true
Leftist	false
Red-Black	true
Splay	true

A tree is traversable if it can be traversed such that the resulting sequence is sorted.