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.
Van Emde Boas tree implementation that I did for a university course
My bachelor's and master's theses
Van EmdeBoas Tree, AVL tree, Red Black Tree
An implementation of the van Emde Boas tree data structure, yielding extremely fast asymptotic runtime complexities for queries: O(log(log(n)))
Basic C++ implementation of Van Emde Boas Tree
Add a description, image, and links to the van-emde-boas-tree topic page so that developers can more easily learn about it.
To associate your repository with the van-emde-boas-tree topic, visit your repo's landing page and select "manage topics."