A Functional Approach to Standard Binary Heaps
Data Structures and Algorithms
2013-12-18 v1
Abstract
This paper describes a new and purely functional implementation technique of binary heaps. A binary heap is a tree-based data structure that implements priority queue operations (insert, remove, minimum/maximum) and guarantees at worst logarithmic running time for them. Approaches and ideas described in this paper present a simple and asymptotically optimal implementation of immutable binary heap.
Keywords
Cite
@article{arxiv.1312.4666,
title = {A Functional Approach to Standard Binary Heaps},
author = {Vladimir Kostyukov},
journal= {arXiv preprint arXiv:1312.4666},
year = {2013}
}