A Lock-free Binary Trie

Jeremy Ko

A binary trie is a sequential data structure for a dynamic set on the universe $\{0,\dots ,u-1\}$ supporting Search with $O(1)$ worst-case step complexity, and Insert, Delete, and P…