Abstract
This chapter will introduce heaps. A heap is an important data structure that returns the highest or lowest element in O(1) time. This chapter will focus on explaining how heaps are implemented as well as how to work with them. One example is heap sort, which is a sorting algorithm based on heaps.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Sammie Bae
About this chapter
Cite this chapter
Bae, S. (2019). Heaps. In: JavaScript Data Structures and Algorithms. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3988-9_16
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3988-9_16
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3987-2
Online ISBN: 978-1-4842-3988-9
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books