Purely Functional Worst Case Constant Time Catenable Sorted Lists

We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant time. Hence, we solve an open problem posed by Kaplan and Tarjan as to whether it is possible to envisage a data structure supporting simultaneously the join operation in O(1) time and the search and update operations in O(log n) time.

• Type: Conference
• Year: 2006
• Where: ESA
• Authors: Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas
• Keywords: Algorithms, Case Constant Time, ESA 2006, Purely Functional, Search Trees