Go implementation of the van Emde Boas tree data structure: Priority queue for positive whole numbers in O(log log u) time.
-
Updated
Nov 5, 2023 - Go
Go implementation of the van Emde Boas tree data structure: Priority queue for positive whole numbers in O(log log u) time.
Add a description, image, and links to the van-emde-boas topic page so that developers can more easily learn about it.
To associate your repository with the van-emde-boas topic, visit your repo's landing page and select "manage topics."