Y-fast trie

In computer science, a y-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor…